Question: The linear programming problem whose output follows determines how many fire red nail polish, bright red nail polish, basil green nail polish, and basic pink

The linear programming problem whose output follows determines how many fire red nail polish, bright red nail polish, basil green nail polish, and basic pink nail polish 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. Constraints 3 and 4 are marketing restrictions.
MAX 100x1+120x2+150x3+125x4
Subject to 1. x1+2x2+2x3+2x4<108
2.3x1+5x2+ x4<120
3. x1+ x3<25
4. x2+ x3+ x4>50
Optimal Solution:
Objective Function Value =7475.000
Variable Value Reduced Costs
X180
X205
X3170
X4330
Constraint Slack / Surplus Dual Prices
1075
2630
3025
40-25
Objective Coefficient Ranges
Variable Lower Limit Current Value Upper Limit
X187.5100 none
X2 none 120125
X3125150162
X4120125150
Right Hand Side Ranges
Constraint Lower Limit Current Value Upper Limit
1100108123.75
257120 none
382558
441.55054
By how much can the amount of space decrease before there is a change in the profit?
Group of answer choices
3
2
1
0

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!