Question: Solve the linear programming problem in problem by applying the simplex method to the dual problem. Repeat Problem 43 with C = 4x1 + 7x2
Repeat Problem 43 with C = 4x1 + 7x2 + 5x3 + 6x4.
Problem 43
Minimize C = 5x1 + 4x2 + 5x3 + 6x4
subject to x1 + x2 ≤ 12
x3 + x4 ≤ 25
x1 + x3 ≥ 20
x2 + x4 ≥ 15
x1, x2, x3, x4 ≥ 0
Step by Step Solution
3.42 Rating (180 Votes )
There are 3 Steps involved in it
The first and second inequalities must be rewritten before forming the dual Mini... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
828-B-F-F-M (3881).docx
120 KBs Word File
