Mathematics - Extra Topics Question with Solution | TestHub
The linear programming problem:
Maximize :
Subject to :
has:
Options:
Answer:
Solution:
The given constraints are , , , and .
To find the feasible region, we determine the corner points by finding the intersections of the boundary lines:
1) Intersection of and gives .
2) Intersection of and gives .
3) Intersection of and gives .
4) Intersection of and gives .
5) Intersection of and gives .
All these points satisfy all the given constraints, so they are the corner points of the feasible region.
Now, we evaluate the objective function at each corner point:
At ,
At ,
At ,
At ,
At ,
The maximum value of is , which occurs at two adjacent corner points, and .
Since the maximum value occurs at two distinct corner points, it will also occur at every point on the line segment joining these two points. Because a line segment contains an infinite number of points, the linear programming problem has an infinite number of optimal solutions.
Answer: infinite number of optimal solutions
