Mathematics - Extra Topics Question with Solution | TestHub
The L.P.P. , minimize , has
Options:
Answer:
Solution:
The objective function to be minimized is .
The given constraints are:
To find the feasible region, we determine the corner points by solving the boundary equations:
1) Intersection of and :
Subtracting the first from the second gives .
Substituting in gives .
So, one corner point is .
2) Intersection of with the -axis ():
.
So, another corner point is .
3) Intersection of with the -axis ():
.
So, a corner point is .
4) Intersections of with the axes are and .
The corner points of the feasible region are , , , , and .
Now, we evaluate the objective function at each corner point:
At :
At :
At :
At :
At :
The minimum value of is , which occurs at two adjacent corner points, and .
Since the minimum value is the same at two distinct corner points, it will be the same at all points on the line segment joining them. Therefore, the L.P.P. has infinitely many solutions.
Answer: infinitely many solutions
