[Solution Library] The linear programming problem whose output follows is used to determine how many bottles of fire red nail polish (x 1), bright red nail


Question: The linear programming problem whose output follows is used to determine how many bottles of fire red nail polish (x 1 ), bright red nail polish (x 2 ), basil green nail polish(x 3 ), and basic pink nail polish(x 4 ) 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 green polish is 25 bottles, while constraint 4 specifies that the minimum demand for bright red, green and pink nail polish bottles combined is at least 50 bottles.

MAX 100x 1 + 120x 2 + 150x 3 + 125x 4

Subject to i. x 1 + 2x 2 + 2x 3 + 2x 4 \(\le \) 108

ii. 3x 1 + 5x 2 + x 4 \(\le \) 120

iii. x 1 + x 3 \(\le \) 25

iv. x 2 + x 3 + x 4 \(\ge \) 50

x 1 , x 2 , x 3 , x 4 \(\ge \) 0

Optimal

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

log in to your account

Don't have a membership account?
REGISTER

reset password

Back to
log in

sign up

Back to
log in