Question: Blending Problem.

A homeowner wants to paint his house. It has to be a one-coat job. To satisfy this requirement, the paint must have a viscosity of at least 200 centipoises. Another requirement is that, for the desired level of brilliance, there must be at least 14 g of a chemical ingredient A in each gallon of the paint. In addition, for a desired degree of durability, at least 30 g of another chemical B must be present in each gallon of paint.

There are two kinds of paint (X ₁ and X ₂ ) available to him. Type X ₁ costs $6 per gallon, and type X ₂ costs $4 per gallon. Their specifications include the following:

The homeowner decides to blend the two paints. He wants to make sure that combining the two paints yields at least 1 gallon of paint.

1. Present the linear program for this problem (including all constraints).
2. How much of X ₁ and X ₂ should be used in each gallon of the blend? Within what range of objective coefficient values does this solution remain unchanged? This is not an integer programming problem.
3. Why does reduced cost equal zero for the two variables?
4. Which constraints are binding? Which constraints are non-binding?
5. Present the dual (shadow) prices of the constraints that are binding and interpret.

Price: $2.99

Solution: The downloadable solution consists of 3 pages
Deliverable: Word Document