Mathematics - Extra Topics Question with Solution | TestHub
The L.P.P. Maximize subject to , , , has
Options:
Answer:
Solution:
The given linear programming problem is to maximize subject to the constraints:
First, we find the corner points of the feasible region by solving the equations of the boundary lines.
The x-intercepts of the lines and are and respectively. The valid corner point on the x-axis is .
The y-intercepts of the lines are and respectively. The valid corner point on the y-axis is .
To find the intersection of and , we substitute into the first equation:
So, the intersection point is .
The corner points of the feasible region are , , , and .
Now, we evaluate the objective function at each corner point:
At :
At :
At :
At :
The maximum value of is , which occurs at two adjacent corner points, and .
Since the maximum value is attained at two distinct corner points, it will also be attained at all points on the line segment joining these two points. Therefore, the problem has infinite solutions.
Answer: infinite solutions
