Solve the linear programming problem. Maximize, subject to constraints , and , .
None of the above
Explanation for the correct option:
Find the maximum value of :
Given,
constraints are
Solving equation
We get,
as an intersecting point of two lines.
Plot all these equations in a graph.
Observing the graph is the feasible region, and the points are
,,
Substitute all these points in the equation
At
At
At
Therefore the maximum value of is , which is obtained at
Hence, option (E) is the correct answer.