4. Here is another primal LP problem! maximise + 2x2x3 subject to X1 ...

Transcribed Image Text:

4. Here is another primal LP problem! maximise ₁ + 2x2x3 subject to X1 <5 <3 x2 3x₂ + x3 X1, X2, X3 > 0 (a) Write down the corresponding dual problem, using variables Y1 and Y2. (b) Use complementary slackness conditions to show that x3 = 0 must be satisfied in an optimal primal solution. (c) Use complementary slackness conditions, or otherwise, to show that (y₁, Y2) = (1, 1) is the optimal dual solution, and determine the corresponding optimal primal solution. 4. Here is another primal LP problem! maximise ₁ + 2x2x3 subject to X1 <5 <3 x2 3x₂ + x3 X1, X2, X3 > 0 (a) Write down the corresponding dual problem, using variables Y1 and Y2. (b) Use complementary slackness conditions to show that x3 = 0 must be satisfied in an optimal primal solution. (c) Use complementary slackness conditions, or otherwise, to show that (y₁, Y2) = (1, 1) is the optimal dual solution, and determine the corresponding optimal primal solution.

Answer rating: 100% (QA)

Steps Step 1 of 3 a Explanation The dual of a linear programming problem is formulated by transposin... View the full answer