Question: Write the dual of the following linear programming problem: Maximize Subject to Z = 3 x 1 + 5 x 2 + 4 x 3

  1. 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

  1. Find the optimal solution to the given problem in (a) above, using the simplex method.
  1. From the final optimal table in (b) above, find the solution to the dual problem.
  2. Give the economic interpretation to the solution in (c) above.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock 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 General Management Questions!