Solved

In a Linear Programming Problem, There Are 3 Binding Constraints

Question 11

Multiple Choice

In a linear programming problem, there are 3 binding constraints. Constraint A has slope -1.5, constraint B has slope -0.5, and constraint C has slope -0.2. The objective function's slope is -1.2. Where would the optimal solution lie?


A) At the intersection of constraints A and B
B) At the intersection of constraints B and C
C) At the intersection of constraint A and the horizontal axis
D) At the intersection of constraint C and the vertical axis
E) Anywhere along constraint A

Correct Answer:

verifed

Verified

Unlock this answer now
Get Access to more Verified Answers free of charge

Related Questions

Unlock this Answer For Free Now!

View this answer and more for free by performing one of the following actions

qr-code

Scan the QR code to install the App and get 2 free unlocks

upload documents

Unlock quizzes for free by uploading documents