# Question

Consider the following problem.

Minimize Z = x1 + 2x2,

Subject to

And

x1 ≥ 0, x2 ≥ 0.

(a) Construct the dual problem.

Minimize Z = x1 + 2x2,

Subject to

And

x1 ≥ 0, x2 ≥ 0.

(a) Construct the dual problem.

## Answer to relevant Questions

Consider the two versions of the dual problem for the radiation therapy example that are given in Tables 6.15 and 6.16. Review in Sec. 6.4 the general discussion of why these two versions are completely equivalent. Then fill ...Consider the dual problem for the Wyndor Glass Co. example given in Table 6.1. Demonstrate that its dual problem is the primal problem given in Table 6.1 by going through the conversion steps given in Table 6.13. Construct a pair of primal and dual problems, each with two decision variables and two functional constraints, such that both problems have no feasible solutions. Demonstrate this property 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 ...Reconsider the Union Airways problem and its spreadsheet model that was dealt with in Prob. 7.3-6. Management now is considering increasing the level of service provided to customers by increasing one or more of the numbers ...Post your question

0