Share
Explore BrainMass

Proof Optimal Solution

Consider a symmetric square matrix A and the following linear program:
Min cx
St Ax > c
x > 0
Prove that if x* satisfies Ax* = c and x* > 0 then x* is an optimal solution to this linear program.

Solution Summary

This solution is comprised of a detailed explanation to prove that if x* satisfies Ax* = c and x* > 0 then x* is an optimal solution to this linear program.

$2.19