Question: Consider the following problem. Maximize Z = 2x1 x2 + x3, Subject to and x1 ¥ 0, x2 ¥ 0, x3 ¥ 0. If we
Consider the following problem.
Maximize Z = 2x1 x2 + x3,
Subject to
-1.png)
and
x1 ¥ 0, x2 ¥ 0, x3 ¥ 0.
If we let x4, x5, and x6 be the slack variables for the respective constraints, the simplex method yields the following final set of equations:
-2.png)
3x 2 2x 15 (0) (1) Z +2x3 +x4 + x5 x2 + 5x3 +x4 + 3x5 =18 =24 (3) x1 +4x3 +x4 + 2x5-21.
Step by Step Solution
3.46 Rating (159 Votes )
There are 3 Steps involved in it
a b 1 5 b 2 1 b 3 2 The current basic solution is feasible and optimal b c 3 1 z 3 c 3 1 The ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
545-M-S-L-P (497).docx
120 KBs Word File
