Question: Consider the following LP: Maximize z = 3x1 + 2x2 + 3x3 Subject to 2x2 + x2 + x3 2 3x1 + 4x2 +
Consider the following LP:
Maximize z = 3x1 + 2x2 + 3x3
Subject to
2x2 + x2 + x3 ‰¤ 2
3x1 + 4x2 + 2x3 ‰¥ 81
X1, x2, x3 ‰¥ 0
The optimal simplex tableau at the end of Phase I is given as
.png)
Explain why the non-basic variables X1 > X3, X4, and X5 can never assume positive values at the end of Phase II. Hence, conclude that their columns can dropped before we start Phase II. In essence, the removal of these variables reduces the constraint equations of the problem to X2 = 2. This means that it will not be necessary to carry out Phase II at all, because the solution space is reduced to one point only.
R Solution -5 0 -40 R-5 4
Step by Step Solution
3.45 Rating (165 Votes )
There are 3 Steps involved in it
If x 1 x 3 x 4 or x 5 assume a positive value the value ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
448-M-S-L-P (1407).docx
120 KBs Word File
