Question: Consider the following problem. Maximize Z = 5x1 + 5x2 + 13x3, Subject to and xj ¥ 0 (j = 1, 2, 3). If we
Maximize Z = 5x1 + 5x2 + 13x3,
Subject to
and
xj ¥ 0 (j = 1, 2, 3).
If we let x4 and x5 be the slack variables for the respective constraints, the simplex method yields the following final set of equations:
-2.png)
12 4210 90 (0) Z +2x3 + 5x4 =100 -Xi +X2 + 3x3 + 14 20 16, -2x3-4x4 +X5 =10. (2)
Step by Step Solution
3.51 Rating (164 Votes )
There are 3 Steps involved in it
a New Tableau The current basic solution is infeasible and su... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
545-M-S-L-P (467).docx
120 KBs Word File
