# Question

Consider the linear programming model in Prob. 4.5-4.

(a) Construct the primal-dual table and the dual problem for this model.

(b) What does the fact that Z is unbounded for this model imply about its dual problem?

(a) Construct the primal-dual table and the dual problem for this model.

(b) What does the fact that Z is unbounded for this model imply about its dual problem?

## Answer to relevant Questions

Consider the following problem. Maximize Z = 2x1 – 4x2, Subject to x1 – x2 ≤ 1 and x1 ≥ 0, x2 ≥ 0. Consider the following problem. Maximize Z = x1 + x2, Subject to and x2 ≥ 0 (x1 unconstrained in sign). (a) Use the SOB method to construct the dual problem. (b) Use Table 6.12 to convert the primal problem to our standard ...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 ...Construct and graph a primal problem with two decision variables and two functional constraints that has feasible solutions and an unbounded objective function. Then construct the dual problem and demonstrate graphically ...Consider the following problem. Maximize Z = –5x1 + 5x2 + 13x3, Subject to and xj ≥ 0 (j = 1, 2, 3). If we let x4 and x5 be the slack variables for the respective constraints, the simplex method yields the following ...Post your question

0