Mathematics - Extra Topics Question with Solution | TestHub
The solution set for minimizing the function with constraints contains
Options:
Answer:
Solution:
The objective function to be minimized is .
The given constraints are:
The feasible region is bounded by the vertices obtained by the intersection of the lines corresponding to the constraints. Let us find the corner points of the feasible region:
Intersection of and gives .
Intersection of and gives .
Intersection of and gives .
Intersection of and gives .
Intersection of and gives .
All these points satisfy the given constraints, so they are the vertices of the feasible region.
Now, we evaluate the objective function at each of these vertices:
At ,
At ,
At ,
At ,
At ,
The minimum value of is , which occurs at two distinct corner points, and .
Since the minimum value occurs at two vertices, it will also occur at all points on the line segment joining these two vertices. Therefore, the solution set contains infinitely many points.
Answer: infinitely many points
