Question: Consider the following linear programming. Minimize 2X + 3Y Subject to 3X + Y >= 9 X + 2Y >= 8 X + Y >=
Consider the following linear programming.
Minimize 2X + 3Y Subject to 3X + Y >= 9 X + 2Y >= 8 X + Y >= 6 X >= 1 Y >= 1
1: This linear programming has _____ corner points
2: The objective value for the optimal corner point is ___
3: The objective value for the second-best corner point is _____
4 Suppose I start increasing the coefficient of Y in the objective function (currently 3). What is the smallest value for which the current second-best corner point becomes an optimal solution? (enter the value of the new coefficient, NOT the change NOR the value of objective.)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
