MHT CET202616 April 2026Morning ShiftMathematicsLinear ProgrammingActual
The feasible region represented by the constraints y - 2x 4, x + y 5, x 4, y 2, x, y 0 is ...........
Options
- Aa convex bounded region with 4 corner points
- Ban unbounded region
- Ca convex bounded region with 5 corner points
- Dno feasible region
Correct answer
A. a convex bounded region with 4 corner points
Step-by-step solution
The given constraints are: y - 2x 4 x + y 5 x 4 y 2 x 0, y 0 To find the corner points of the feasible region, we solve the boundary equations pairwise and check if the intersection points satisfy all other constraints. 1. Intersection of y - 2x = 4 and x + y = 5 : Substituting y = 5 - x into the first equation: 5 - x - 2x = 4 3x = 1 x = 1 3 y = 5 - 1 3 = 14 3 Point: ( 1 3 , 14 3 ) . This satisfies x 4 and y 2 . 2. Intersection of y - 2x = 4 and x = 4 : y - 2(4) = 4 y = 12 Point: (4, 12) . This satisfies x + y = 16