Question:

Consider the Linear Programming Problem (LPP): Maximize $z = 30x + 60y$ subject to constraints $x + 2y \leq 12$, $2x + y \leq 12$, $4x + 5y \geq 20$, $x \geq 0$, $y \geq 0$. Then the number of corner points of the feasible region is

Show Hint

Always consider only feasible intersections (satisfying all inequalities).
Updated On: Apr 24, 2026
  • $8$
  • $6$
  • $3$
  • $4$
  • $5$
Show Solution
collegedunia
Verified By Collegedunia

The Correct Option is

Solution and Explanation

Concept:
• Corner points are intersections of constraint lines

Step 1:
Plot constraints
\[ x + 2y = 12,\quad 2x + y = 12,\quad 4x + 5y = 20 \]

Step 2:
Consider region
Region lies in first quadrant satisfying all inequalities.

Step 3:
Find intersections
Each pair of lines intersects giving vertices.

Step 4:
Count feasible vertices
After checking all constraints, total corner points = 5 Final Conclusion:
\[ = 5 \]
Was this answer helpful?
0
0