Short Answer
The linear programming problem whose output follows determines how many red nail polishes, blue nail polishes, green nail polishes, and pink nail polishes 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
x1, x2, x3, x4 ? 0
Optimal Solution:
Objective Function Value = 7475.000
Objective Coefficient Ranges
Right Hand Side Ranges
-By how much will the second marketing restriction be exceeded?
Correct Answer:

Verified
Correct Answer:
Verified
Q35: A basic feasible solution satisfies the model
Q36: Given the following linear programming problem:<br>
Q37: The basic feasible solution in the initial
Q38: A basic feasible solution satisfies the model
Q39: The dual form of a linear program
Q41: The linear programming problem whose output
Q42: The linear programming problem whose output
Q43: Consider the following linear programming problem
Q44: The _ form of a linear program
Q45: In the simplex procedure, if all cj