# Question: Follow the instructions of Prob 7 4 2 when considering the following

Follow the instructions of Prob. 7.4-2 when considering the following problem and the information provided about its parameters in the table below.

Minimize Z = c1x1 + c2x2,

subject to the constraints shown at the top of the next column.

and

x1 ≥ 0, x2 ≥ 0,

(a) Use the graphical method to solve this model when using the estimates of the parameters.

(b) Now use robust optimization to formulate a conservative version of this model. Use the graphical method to solve this model. Show the values of Z obtained in parts (a) and (b) and then calculate the percentage change in Z by replacing the original model by the robust optimization model.

Minimize Z = c1x1 + c2x2,

subject to the constraints shown at the top of the next column.

and

x1 ≥ 0, x2 ≥ 0,

(a) Use the graphical method to solve this model when using the estimates of the parameters.

(b) Now use robust optimization to formulate a conservative version of this model. Use the graphical method to solve this model. Show the values of Z obtained in parts (a) and (b) and then calculate the percentage change in Z by replacing the original model by the robust optimization model.

## Answer to relevant Questions

Consider the following problem. Maximize Z = 5x1 + c2x2 + c3x3, Subject to and x1 ≥ 0, x2 ≥ 0, x3 ≥ 0. The estimates and ranges of uncertainty for the uncertain parameters are shown in the next table. (a) Solve this ...Consider the following problem. Maximize z = 20x1 + 30x2 + 25x3, Subject to and x1 ≥ 0, x2 ≥ 0, x3 ≥ 0, where b1, b2, and b3 are uncertain parameters that have mutually independent normal distributions. The mean and ...Consider the following problem. Maximize Z = 2x1 + 7x2 – 3x3, Subject to and x1 ≥ 0, x2 ≥ 0, x3 ≥ 0. By letting x4 and x5 be the slack variables for the respective constraints, the simplex method yields the following ...Consider the following problem. Maximize Z = 8x1 + 24x2, Subject to And x1 ≥ 0, x2 ≥ 0. Suppose that Z represents profit and that it is possible to modify the objective function somewhat by an appropriate shifting of key ...Use the upper bound technique manually to solve the following problem. Maximize Z = 2x1 + 3x2 – 2x3 + 5x4, subject to andPost your question