Question:medium

The feasible region of a linear programming problem is always:

Show Hint

Remember the fundamental property of feasible regions in LPPs: they are always convex polygons (or polyhedra). This convexity is what allows the "corner point method" for finding optimal solutions.
Updated On: May 16, 2026
  • Circular
  • Open
  • Convex
  • Irregular
Show Solution

The Correct Option is C

Solution and Explanation

Was this answer helpful?
0

Top Questions on Graphical Method of Solution of a Pair of Linear Equations


Questions Asked in CUET (UG) exam