Question

Show with the help of an example how when one solves an linear programming problem by simplex method going through infeasible but better than optimal solution, one directly goes through infeasible better than optimal solution of the dual linear programming problem. How is this fact utilized in the solution of the dual?

Answer 1

Answer:

x1 = number of flat-bed trailers produced per month,

x2 = number of economy trailers produced per month,

x3 = number of luxury trailers produced per month.

The constraining resources of the production operation are the metalworking and woodworking capacities

measured in days per month. The linear program to maximize contribution to the firm’s overhead (in hundreds

of dollars) is:

Maximize z = 6x1 + 14x2 + 13x3,

subject to:

1

2

x1 + 2x2 + x3 ≤ 24,

x1 + 2x2 + 4x3 ≤ 60, (1)

x1 ≥ 0, x2 ≥ 0, x3 ≥ 0.

Step-by-step explanation: