Maximize Z = 6x + 4y, subject to x ≤ 2, x + y ≤ 3, -2x + y ≤ 1, x ≥ 0, y ≥ 0
Correct Answer :
16 at (2, 1)
Solution :
The correct option is 16 at (2, 1).
To find the maximum value of the objective function subject to the given constraints, we can use the graphical method of linear programming. First, we identify the feasible region determined by the following inequalities:
1.
2. (implied by non-negativity) and
3.
4. ,
Let us find the boundary lines and their intersection points to determine the corner points (vertices) of the feasible region:
- The line is the y-axis, and is the x-axis.
- The line is a vertical line passing through .
- The line intersects the axes at and .
- The line intersects the axes at and .
Next, we solve for the intersection points of these boundary lines that lie in the first quadrant (, ):
- Intersection of and gives the corner point .
- Intersection of and :
Subtracting the first equation from the second equation:
Substituting into gives . This gives the corner point .
- Intersection of and :
Substituting into the equation gives . This gives the corner point .
- Intersection of and the x-axis () gives the corner point .
- The origin is also a corner point.
The bounded feasible region is defined by the vertices , , , , and .
Now, we evaluate the objective function at each of these corner points:
1. At :
2. At :
3. At :
4. At :
5. At :
Comparing these values, the maximum value of is , which occurs at the 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.