Z = 20x1 + 202, subject to x1 ≥ 0, x2 ≥ 0, x1 + 2x2 ≥ 8, 3x1 + 2x2 ≥ 15, 5x1 + 2x2 ≥ 20. The minimum value of Z occurs at
Correct Answer :
(7/2, 9/4)
Solution :
The correct option is (7/2, 9/4).
To find the point at which the objective function is minimized, we need to analyze the system of linear inequalities (constraints) and determine the corner points of the feasible region.
The given constraints are:
1. (First quadrant)
2.
3.
4.
Let's find the intersection points of the boundary lines to locate the corner points of the feasible region:
Boundary Line 1:
If , then . Point: (0, 4)
If , then . Point: (8, 0)
Boundary Line 2:
If , then . Point: (0, 15/2)
If , then . Point: (5, 0)
Boundary Line 3:
If , then . Point: (0, 10)
If , then . Point: (4, 0)
Since all constraints are of the type "", the feasible region is unbounded and lies above and to the right of the boundary lines in the first quadrant.
Let's determine the intersection points between these boundary lines to identify the corner points of this boundary:
Intersection of Line 1 () and Line 2 ():
Subtracting the first equation from the second:
Substituting into Line 1:
This gives the corner point (7/2, 9/4).
Intersection of Line 2 () and Line 3 ():
Subtracting the first equation from the second:
Substituting into Line 2:
This gives the corner point (5/2, 15/4).
The corner points of the feasible region are:
-
-
-
-
Now, we evaluate the objective function at each corner point:
1. At :
2. At :
3. At :
4. At :
Comparing the values, the minimum value of is , which occurs at the corner point .
Access expert-curated educational resources and study materials—completely free.
Create, conduct, and manage professional online assessments with Crey. Perfect for teachers and institutes.
Copyright © 2026 Crey. All Rights Reserved.