# Question

For each of the following linear programming models, use the SOB method to construct its dual problem.

(a) Model in Prob. 4.6-7

(b) Model in Prob. 4.6-16

(a) Model in Prob. 4.6-7

(b) Model in Prob. 4.6-16

## Answer to relevant Questions

Consider the model with equality constraints given in Prob. 4.6-2. (a) Construct its dual problem. (b) Demonstrate that the answer in part (a) is correct (i.e., equality constraints yield dual variables without nonnegativity ...Consider the following problem. Maximize Z = 2x1 + 6x2 + 9x3, Subject to and x1 ≥ 0, x2 ≥ 0, x3 ≥ 0. (a) Construct the dual problem for this primal problem. For the problem given in Table 7.5, find the allowable range for c2. Show your work algebraically, using the tableau given in Table 7.5. Then justify your answer from a geometric viewpoint, referring to Fig. 7.2. Reconsider the model given in Prob. 7.3-1. While doing sensitivity analysis, you learn that the estimates of the right-hand sides of the two functional constraints are accurate only to within ±50 percent. In other words, ...Consider the following problem. Maximize Z = c1x1 + c2x2, Subject to and x1 ≥ 0, x2 ≥ 0. The estimates and ranges of uncertainty for the parameters are shown in the next table. (a) Use the graphical method to solve this ...Post your question

0