Short Answer
The linear programming problem whose output follows is used to determine how many bottles of red nail polish (x1), blue nail polish (x2), green nail polish (x3), and 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 red and green polish is 25 bottles, while constraint 4 specifies that the minimum demand for blue, green, and pink nail polish bottles combined is at least 50 bottles.
MAX
Subject to 1 .
2.
3.
4.
Optimal Solution:
Objective Function Value = 7475.000
Objective Coefficient Ranges
Right Hand Side Ranges
-a) By how much can the amount of space decrease before there is a change in the profit?
b) By how much can the amount of space decrease before there is a change in the product mix?
c) By how much can the amount of time available to set up the display can increase before the solution (product mix) would change?
d) What is the lowest value for the amount of time available to set up the display increase before the solution (product mix) would change?
Correct Answer:

Verified
a) 0
b) ...View Answer
Unlock this answer now
Get Access to more Verified Answers free of charge
Correct Answer:
Verified
b) ...
View Answer
Unlock this answer now
Get Access to more Verified Answers free of charge
Q39: Tracksaws, Inc. makes tractors and lawn
Q40: Consider the following linear program, which
Q41: Given the following linear programming problem that
Q42: The terms shadow price and dual price
Q43: Tracksaws, Inc. makes tractors and lawn
Q45: Mallory Furniture buys two products for resale:
Q46: Given the following linear programming problem that
Q47: Taco Loco is considering a new
Q48: The sensitivity range for an objective function
Q49: The sensitivity range for a constraint quantity