# Question: Consider the following problem Maximize z x1 7x2

Consider the following problem.

Maximize z = x1 – 7x2 + 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 resources and describe their significance.

(c) Use a software package based on the simplex method to solve the problem and then to generate sensitivity information. Use this information to identify the shadow price for each resource, the allowable range for each objective function coefficient and the allowable range for each right and side.

Maximize z = x1 – 7x2 + 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 resources and describe their significance.

(c) Use a software package based on the simplex method to solve the problem and then to generate sensitivity information. Use this information to identify the shadow price for each resource, the allowable range for each objective function coefficient and the allowable range for each right and side.

**View Solution:**## Answer to relevant Questions

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 ...From the tenth floor of her office building, Katherine Rally watches the swarms of New Yorkers fight their way through the streets infested with yellow cabs and the sidewalks littered with hot dog stands. On this sweltering ...Label each of the following statements about linear programming problems as true or false, and then justify your answer. Suppose that the three-variable linear programming problem given in Fig. 5.2 has the objective function Maximize Z = 3x1 + 4x2 + 3x3. Work through the matrix form of the simplex method step by step to solve the model given in Prob. 4.7-6.Post your question