Consider the following problem.
Maximize Z = x1 + 4x2 + 2x3,
Subject to

and x2 ‰¥ 0, x3 ‰¥ 0.
(no nonnegativity constraint for x1).
(a) Reformulate this problem so all variables have nonnegativity constraints.
(b) Work through the simplex method step by step to solve the problem.
(c) Use a software package based on the simplex method to solve the problem.

Transcribed Image Text:

4x, +2 213 s 5 -회 +x2 + 2xs10