Question: Suppose a primal minimization problem and its dual maximization problem were solved by using the simplex method on the dual problem, and the final simplex

Suppose a primal minimization problem and its dual maximization problem were solved by using the simplex method on the dual problem, and the final simplex matrix is given.

(a) Find the solution of the minimization problem. Use y1, y2, y3 as the variables and g as the function.

(b) Find the solution of the maximization problem. Use x1, x2, x3 as the variables and f as the function.

1.

-κΈ€0 3 15 1 -2 -1 13 29 -1 4 0 1 452 2 0 mlin =n lun +

2.

16 1 11 19 22 12 15 20 1 554 lun -lin mlun

-0 3 15 1 -2 -1 13 29 -1 4 0 1 452 2 0 mlin =n lun + 16 1 11 19 22 12 15 20 1 554 lun -lin mlun

Step by Step Solution

3.38 Rating (164 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

1 a For the minimization problem the last entries in the columns corresponding ... 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

Document Format (1 attachment)

Word file Icon

1386-M-C-L-A-D(2918).docx

120 KBs Word File

Students Have Also Explored These Related Calculus Questions!