Question: let a be a symmetric square matrix consider the linear...
Let A be a symmetric square matrix. Consider the linear programming problem:
subject to Ax >= c
x >= 0.
Prove that if x* satisfies Ax* = c and x* >= 0, then x* is an optimal solution.