Question: Dual simplex with Artificial constraints. Consider the following problem: Maximize z = 2x1 - x2 + x3 Subject to 2x1 + 3x2 - 5x3
Maximize z = 2x1 - x2 + x3
Subject to
2x1 + 3x2 - 5x3 ≥ 4
- x1 + 9x2 - x3 ≥ 3
4x1 + 6x2 + 3x3 ≤ 8
X1, x2, x3 ≥ 0
Step by Step Solution
3.45 Rating (177 Votes )
There are 3 Steps involved in it
Add the constraints x 1 x 3 M The second tableau is now optimal but infeasib... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
448-M-S-L-P (1488).docx
120 KBs Word File
