MHT CET202522 Apr 2025Evening ShiftMathematicsLinear ProgrammingActual
The correct constraints for the given feasible region are ....
Options
- Ay -x 1, x+5 y 10, x+ y 2, x, y 0
- By-x 1,2 x+5 y 10, x+y 1, x, y 0
- Cy-x 1,2 x+5 y 10, x+y 1, x, y 0
- Dx- y 1,2 x+5 y 10, x+ y 1, x, y 0
Correct answer
C. y-x 1,2 x+5 y 10, x+y 1, x, y 0
Step-by-step solution
The feasible region is bounded by three lines: L 1 , L 2 , and L 3 . Their equations are determined from the intercepts and slopes: For L 1 through (0, 1) and (1, 2): y - x = 1 . For L 2 through (0, 2) and (5, 0): 2x + 5y = 10 . For L 3 through (0, 1) and (1, 0): x + y = 1 . Testing point (0.5, 1.5) within the shaded region determines the inequality directions: y - x 1 (above L 1 ), 2x + 5y 10 (below L 2 ), x + y 1 (above L 3 ). Non-negativity constraints x 0 , y 0 apply since the region lies in the first quadrant.