Redo Problem 7.14, using the following data:

In Fig. 7-13, with the isocost line tangent to constraint A, there is no unique optimal feasible solution. Any point on the line between (5, 8) and (10, 4) will minimize the objective function subject to the constraints. Multiple optimal solutions occur whenever there is linear dependence between the objective function and one of the constraints. In this case, the objective function and constraint A both have a slope of -4/5 and are linearly dependent. Multiple optimal solutions, however, in no way contradict the extreme point theorem since the extreme points (5, 8) and (10, 4)
are also included in the optimal solutions: c = 16(5) + 20(8) = 240 and c = 16(10) +20(4) = 240.

Transcribed Image Text:

Minimize subject to c = 16y1 + 20y2 2y+2.5y230 (constraint A) 3y + 7.5y2 60 (constraint B) 8y+5y280 (constraint C) y, y2 0