# Question: Consider the following problem Minimize Z 5x1 c2x2 Subject to and x1

Consider the following problem.

Minimize Z = 5x1 + c2x2,

Subject to

and

x1 ≥ 0, x2 ≥ 0,

where x1 represents the level of activity 1 and x2 represents the level of activity 2. The values of c2, a12, and a22 have not been determined yet. Only activity 1 needs to be undertaken soon whereas activity 2 will be initiated somewhat later. There are different scenarios that could unfold between now and the time activity 2 is undertaken that would lead to different values for c2, a12, and a22. Therefore, the goal is to use all of this information to choose a value for x1 now and to simultaneously determine a plan for choosing a value of x2 later after seeing which scenario has occurred.

Three scenarios are considered plausible possibilities. They are listed below, along with the values of c2, a12, and a22 that would result from each one:

Scenario 1: c2 = 4, a12 = 2, and a22 = 3

Scenario 2: c2 = 6, a12 = 3, and a22 = 4

Scenario 3: c2 = 3, a12 = 2, and a22 = 1

These three scenarios are considered equally likely.

Use stochastic programming with recourse to formulate the appropriate model for this problem and then to solve for the optimal plan.

Minimize Z = 5x1 + c2x2,

Subject to

and

x1 ≥ 0, x2 ≥ 0,

where x1 represents the level of activity 1 and x2 represents the level of activity 2. The values of c2, a12, and a22 have not been determined yet. Only activity 1 needs to be undertaken soon whereas activity 2 will be initiated somewhat later. There are different scenarios that could unfold between now and the time activity 2 is undertaken that would lead to different values for c2, a12, and a22. Therefore, the goal is to use all of this information to choose a value for x1 now and to simultaneously determine a plan for choosing a value of x2 later after seeing which scenario has occurred.

Three scenarios are considered plausible possibilities. They are listed below, along with the values of c2, a12, and a22 that would result from each one:

Scenario 1: c2 = 4, a12 = 2, and a22 = 3

Scenario 2: c2 = 6, a12 = 3, and a22 = 4

Scenario 3: c2 = 3, a12 = 2, and a22 = 1

These three scenarios are considered equally likely.

Use stochastic programming with recourse to formulate the appropriate model for this problem and then to solve for the optimal plan.

## Relevant Questions

Refer to Sec. 3.4 (subsection entitled "Controlling Air Pollution") for the Nori & Leets Co. problem. After the OR team obtained an optimal solution, we mentioned that the team then conducted sensitivity analysis. We now ...Reconsider the model of Prob. 7.2-4. Suppose that the right-hand sides of the functional constraints are changed to 30 + 3θ (for constraint 1) and 10 – θ (for constraint 1) where θ can be assigned any positive or ...Use the dual simplex method manually to solve the following problem. Minimize Z = 5x1 + 2x2 + 4x3, Subject to and x1 ≥ 0, x2 ≥ 0, x3 ≥ 0. Use the upper bound technique manually to solve the following problem. Maximize Z = 2x1 + 5x2 +3x3 + 4x4 + x5, Subject to and 0 ≤ xj ≤ 1, for j = 1, 2, 3, 4, 5 Consider the following problem. Maximize Z(θ) = (10 – θ)x1 + (12 + θ) x2 + (7 + 2θ)x3, Subject to and x1 ≥ 0, x2 ≥ 0, x3 ≥ 0.Post your question