# Question: Consider the following constraint whose right hand side b is assumed

Consider the following constraint whose right-hand side b is assumed to have a normal distribution with a mean of 100 and some standard deviation σ.

30x1 + 20x2 ≤ b

A quick investigation of the possible spread of the random variable b has led to the estimate that σ = 10. However, a subsequent more careful investigation has greatly narrowed down this spread, which has led to the refined estimate that σ = 2. After choosing a minimum acceptable probability that the constraint will hold (denoted by α) this constraint will be treated as a chance constraint.

(a) Use a probability expression to write the resulting chance constraint. Then write its deterministic equivalent in terms of σ and Kα.

(b) Prepare a table that compares the value of the right-hand side of this deterministic equivalent for σ = 10 and σ = 2 when using α = 0.9, 0.95, 0.975, 0.99, and 0.99865.

30x1 + 20x2 ≤ b

A quick investigation of the possible spread of the random variable b has led to the estimate that σ = 10. However, a subsequent more careful investigation has greatly narrowed down this spread, which has led to the refined estimate that σ = 2. After choosing a minimum acceptable probability that the constraint will hold (denoted by α) this constraint will be treated as a chance constraint.

(a) Use a probability expression to write the resulting chance constraint. Then write its deterministic equivalent in terms of σ and Kα.

(b) Prepare a table that compares the value of the right-hand side of this deterministic equivalent for σ = 10 and σ = 2 when using α = 0.9, 0.95, 0.975, 0.99, and 0.99865.

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

Suppose that a linear programming problem has 20 functional constraints in inequality form such that their right-hand sides (the bi) are uncertain parameters, so chance constraints with some a are introduced in place of ...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 ...Consider the following problem. Maximize Z = 2x1 – x2 + x3, Subject to and x1 ≥ 0, x2 ≥ 0, x3 ≥ 0. If we let x4, x5, and x6 be the slack variables for the respective constraints, the simplex method yields the ...Consider the following problem. Maximize Z = 3x1 + 2x2, Subject to and x1 ≥ 0, x2 ≥ 0. Reconsider the example used to illustrate the interiorpoint algorithm in Sec. 8.4. Suppose that (x1, x2) = (1, 3) were used instead as the initial feasible trial solution. Perform two iterations manually, starting from this ...Post your question