# Question: Consider the following problem Maximize Z x1 2x2 Subject to and x1

Consider the following problem.

Maximize Z = x1 + 2x2,

Subject to

and

x1 ≥ 0, x2 ≥ 0,

where Z measures the profit in dollars from the two activities and the right-hand sides are the number of units available of the respective resources.

(a) Use the graphical method to solve this model.

(b) Use graphical analysis to determine the shadow price for each of these resources by solving again after increasing the amount of the resource available by 1.

(c) Use the spreadsheet model and Solver instead to do parts (a) and (b).

Maximize Z = x1 + 2x2,

Subject to

and

x1 ≥ 0, x2 ≥ 0,

where Z measures the profit in dollars from the two activities and the right-hand sides are the number of units available of the respective resources.

(a) Use the graphical method to solve this model.

(b) Use graphical analysis to determine the shadow price for each of these resources by solving again after increasing the amount of the resource available by 1.

(c) Use the spreadsheet model and Solver instead to do parts (a) and (b).

## Relevant Questions

One of the products of the G.A. Tanner Company is a special kind of toy that provides an estimated unit profit of $3. Because of a large demand for this toy, management would like to increase its production rate from the ...Reconsider the example illustrating the use of robust optimization that was presented in Sec. 7.4. Wyndor management now feels that the analysis described in this example was overly conservative for three reasons: (1) it is ...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. Maximize Z = 2x1 + 7x2 – 3x3, Subject to and x1 ≥ 0, x2 ≥ 0, x3 ≥ 0. By letting x4 and x5 be the slack variables for the respective constraints, the simplex method yields the following ...Consider the following problem. Maximize Z = x1 – x2, Subject to and x1 ≥ 0, x2 ≥ 0, (a) Solve this problem graphically. (b) Use the dual simplex method manually to solve this problem. (c) Trace graphically the path ...Post your question