The constraints of a maximization problem are graphed below. The slope of the ob
ID: 3254737 • Letter: T
Question
The constraints of a maximization problem are graphed below. The slope of the objective function is -1 (negative one). Which statement is true?
Constraint 1 is always binding.
Constraint 3 is binding.
The problem is infeasible given the equal slopes.
Constraint 2 is never binding.
There are multiple optimal solutions.
The solution lies on BC.
The optimal solution is unique.
The solution(s) lies on GJ.
The solution(s) lies on GH.
The solution(s) lies on HJ.
A.Constraint 1 is always binding.
B.Constraint 3 is binding.
C.The problem is infeasible given the equal slopes.
D.Constraint 2 is never binding.
E.There are multiple optimal solutions.
F.The solution lies on BC.
G.The optimal solution is unique.
H.The solution(s) lies on GJ.
I.The solution(s) lies on GH.
J.The solution(s) lies on HJ.
NOTE: There is a typo in the chart above. [X>50 should read as Y 50] 150 Constraint 1 30 X 10 Y 1500 Constraint 2 100 X 10 YK 1000 100 Constraint 3 X 50 50 50 100 150Explanation / Answer
binding constraint is a constraint used in linear programming equations whose value satisfies the optimal solution; any changes in its value changes the optimal solution. Once an optimal solution is obtained, managers can relax the binding constraint to improve the solution by improving the objective function value.
D is correct
G is correct
H is correct
I is correct
J correct
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.