Question: Write the dual of the following linear programming problem: Maximize Subject to Z = 3 x 1 + 5 x 2 + 4 x 3
- Write the dual of the following linear programming problem:
Maximize Subject to
Z = 3x1 + 5x2 + 4x3 , 2x1 + 3x2 8,
2x2 + 5x3 10
3x1 + 2x2 + 4x3 15
x1, x2 , x3 0
- Find the optimal solution to the given problem in (a) above, using the simplex method.
- From the final optimal table in (b) above, find the solution to the dual problem.
- Give the economic interpretation to the solution in (c) above.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
