You are given a linear programming problem that has already been solved. The following conditions hold:
(i) You are maximizing the objective function 6x + 5y
(ii) After solving the problem, you found that the optimal solution point occurs at the intersection of exactly two of the constraints, namely constraints: (1) 4x +2y ≤ 15 and (2) x + y ≤ 13
Find the range of optimality for Cx, the coefficient associated with variable x by hand using slopes.
SHOW ALL WORK!© BrainMass Inc. brainmass.com March 22, 2019, 1:44 am ad1c9bdddf
This solution shows the steps for how to solve a linear programming problem geometrically using slopes.