# Question

Follow the instructions of Prob. 4.6-9 for the following problem.

Minimize Z = 3x1 + 2x2 + 7x3

Subject to

and x1 ≥ 0, x2 ≥ 0, x3 ≥ 0.

(a) Using the Big M method, work through the simplex method step by step to solve the problem.

(b) Using the two-phase method, work through the simplex method step by step to solve the problem.

Minimize Z = 3x1 + 2x2 + 7x3

Subject to

and x1 ≥ 0, x2 ≥ 0, x3 ≥ 0.

(a) Using the Big M method, work through the simplex method step by step to solve the problem.

(b) Using the two-phase method, work through the simplex method step by step to solve the problem.

## Answer to relevant Questions

Label each of the following statements as true or false, and then justify your answer. This chapter has described the simplex method as applied to linear programming problems where the objective function is to be maximized. Section 4.6 then described how to convert a minimization problem to an equivalent ...Consider the following problem. Maximize Z = 2x1 – 2x2 + 3x3, Subject to and x1 ≥ 0, x2 ≥ 0, x3 ≥ 0. (a) Work through the simplex method step by step to solve the problem. (b) Identify the shadow prices for the three ...Describe graphically what the simplex method does step by step to solve the following problem. Minimize Z = 5x1 + 7x2, Subject to and x1 ≥ 0, x2 ≥ 0. Consider the following problem. Maximize Z = 3x1 + 4x2 + 2x3, Subject to and x1 ≥ 0, x2 ≥ 0, x3 ≥ 0.Post your question

0