# Question

You are given the following linear programming problem.

Maximize Z = 4x1 + 2x2, subject to

and

x1 ≥ 0, x2 ≥ 0.

D,I (a) Solve this problem graphically.

(b) Use graphical analysis to find the shadow prices for the resources.

(c) Determine how many additional units of resource 1 would be needed to increase the optimal value of Z by 15.

Maximize Z = 4x1 + 2x2, subject to

and

x1 ≥ 0, x2 ≥ 0.

D,I (a) Solve this problem graphically.

(b) Use graphical analysis to find the shadow prices for the resources.

(c) Determine how many additional units of resource 1 would be needed to increase the optimal value of Z by 15.

## Answer to relevant Questions

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 ...Repeat Prob. 4.9-1 for the model in Prob. 4.1-5. Repeat Prob. Consider the following problem. Maximize z = 3x1 + 2x2. Subject to and x1 ≥ 0, x2 ≥ 0. Consider the three-variable linear programming problem shown in Fig. 5.2. Work through the matrix form of the simplex method step by step to solve the model given in Prob. 4.1-5.Post your question

0