Question: Show directly that if the primal problem Minimize cx subject to Ax b and x 0 has no feasible solutions, and if the dual

Show directly that if the primal problem Minimize cx subject to Ax ≥ b and x ≥0 has no feasible solutions, and if the dual problem has feasible solution, then dual problem is unbounded.

Use Farkas’ lemma. If the system Ax ≥ b and x ≥ 0 has no solutions, then system wA ≤ 0, w ≥ 0, wb > 0 has solution.

Step by Step Solution

3.41 Rating (151 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

To solve this problem we need to use Farkas lemma to show that if the primal problem which is a linear programming problem has no feasible solutions t... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!