Linear Programming Problem is an important topic in the Mathematics section in MHT CET exam. Practising this topic will increase your score overall and make your conceptual grip on MHT CET exam stronger.
This article gives you a full set of MHT CET PYQs for Linear Programming Problem with explanations for effective preparation. Practice of MHT CET Mathematics PYQs including Linear Programming Problem questions regularly will improve accuracy, speed, and confidence in the MHT CET 2026 exam.
Also Read
MHT CET PYQs for Linear Programming Problem with Solutions
1.
The objective function of $LPP$ defined over the convex set attains its optimum value at- At least two of the corner points
- All the corner points
- At least one of the corner points
- None of the corner points
2.
The objective function $z = 4x_1 + 5x_2$, subject to $2x_1 + x_2 \geq 7 , 2x_1 + 3x_2 \leq 15 , x_2 \leq 3, x_1 , x_2 \geq 0 $ has minimum value at the point- On $x-axis$
- On $y-axis$
- At the origin
- On the line parallel to $x$-axis
3.
The feasible region of the linear programming problem is determined by the system of inequalities: \[ x + y \leq 6, \quad x \geq 0, \quad y \geq 0. \] What is the maximum value of \( x + y \) in the feasible region?- \( 6 \)
- \( 5 \)
- \( 4 \)
- \( 3 \)
Comments