Suppose that the optimal values of the decision variables to a two-variable linear programming problem remain the same as long as the slope of the objective function lies between the slopes of the following two constraints:
2X1 + 3X2 ≤ 26
2X1 + 2X2 ≤20
The current objective function is:
8X1+ 9X2 = Z
Which of the following statements about the range of optimality on c1 is TRUE?
A) 0 ≤ c1 ≤ 2
B) 2 ≤ c1 ≤ 6
C) 6 ≤ c1 ≤ 9
D) 9 ≤c1 ≤ 12
Correct Answer:
Verified
Q1: Which of the following statements regarding linear
Q7: In linear programming, each parameter is assumed
Q10: Consider a corner point to a linear
Q15: A binding constraint is the amount by
Q16: A constraint is a limitation that restricts
Q20: A manager is interested in using linear
Q28: A binding constraint has slack but does
Q34: Only corner points should be considered for
Q48: For the line that has the equation
Q75: The simplex method is an interactive algebraic
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents