Question: The linear programming problem whose output follows is used to determine how many bottles of fire red nail polish (x1), bright red nail polish (x2), basic green nail polish (x3), and basic pink nail polish (x4) a beauty salon should stock. The objective function measures profit; it is assumed that every piece stocked will be sold. Constraint 1 measures display space in units. Constraint 2 measures time to set up the display in minutes. Note that green nail polish does not require any time to prepare its display.  Constraints 3 and 4 are marketing restrictions. Constraint 3 indicates that the maximum demand for fire red and bright red polish is 25 bottles, while constraint 4 specifies that the minimum demand combined for bright red, green, and pink nail polish bottles is at least 50 bottles.

MAX  100x1 + 120x2 + 150x3 + 125x4
Subject to: 1. x1 + 2x2 + 2x3 + 2x4 <= 108
2. 3x1 + 5x2 + x4 <= 120
3. x1 + x2 <= 25
4. x2 + x3 + x4 >= 50
x1, x2 , x3, x4 >= 0

Optimal

Price: $2.99

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