Question: In Problem, a minimization problem, the corresponding dual problem, and the final simplex tableau in the solution of the dual problem are given. (A) Find
(A) Find the optimal solution of the dual problem.
(B) Find the optimal solution of the minimization problem.
Minimize subject to
C = 16x1 + 25x2
3x1 + 5x2 ≥ 30
2x1 + 3x2 ≥ 19
x1, x2 ≥ 0
Maximize subject to
P = 30y1 + 19y2
3y1 + 2y2 ≤ 16
5y1 + 3y2 ≤ 25
y1,y2 ≥ 0
Step by Step Solution
3.44 Rating (160 Votes )
There are 3 Steps involved in it
From the final simplex tableau A The optimal solution of ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
828-B-F-F-M (3869).docx
120 KBs Word File
