Question: Consider the following problem. Maximize Z = 2x1 + 4x2 + 3x3, Subject to and x1 ¥ 0, x2 ¥ 0, x3 ¥ 0. (a)
Maximize Z = 2x1 + 4x2 + 3x3,
Subject to
.png)
and
x1 ¥ 0, x2 ¥ 0, x3 ¥ 0.
(a) Work through the simplex method step by step in algebraic form.
(b) Work through the simplex method step by step in tabular form.
(c) Use a software package based on the simplex method to solve the problem.
3x4x2 2x3 60 2x1 t2 213 40 x 3x2 2 80
Step by Step Solution
3.40 Rating (184 Votes )
There are 3 Steps involved in it
a Set x 1 x 2 x 3 0 0 Z 2x 1 X 4x 2 X 3x 3 0 1 x 1 3x 2 2x 3 x 4 80 x 4 80 2 3x 1 4x 2 2x 3 x 5 60 x 5 60 3 2x 1 x 2 2x 3 x 5 40 x 6 40 Optimality Tes... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
545-M-S-L-P (339).docx
120 KBs Word File
