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

and
x1 ‰¥ 0, x2 ‰¥ 0, x3 ‰¥ 0.

Let x₄ and x₅ be the slack variables for the respective functional constraints. Starting with these two variables as the basic variables for the initial BF solution, you now are given the information that the simplex method proceeds as follows to obtain the optimal solution in two iterations: (1) In iteration 1, the entering basic variable is x₃ and the leaving basic variable is x₄; (2) in iteration 2, the entering basic variable is x₂ and the leaving basic variable is x₅.

(a) Develop a three-dimensional drawing of the feasible region for this problem, and show the path followed by the simplex method.

(b) Give a geometric interpretation of why the simplex method followed this path.

(c) For each of the two edges of the feasible region traversed by the simplex method, give the equation of each of the two constraint boundaries on which it lies, and then give the equation of the additional constraint boundary at each endpoint.

(d) Identify the set of defining equations for each of the three CPF solutions (including the initial one) obtained by the simplex method. Use the defining equations to solve for these solutions.

(e) For each CPF solution obtained in part (d), give the corresponding BF solution and its set of nonbasic variables. Explain how these nonbasic variables identify the defining equations obtained in part (d).

Transcribed Image Text:

2x, + x2 + 2xS4 X + x2 + X3 S 3