Linear Programming PYQs - Last 5 Years
MHT CET / Mathematics / Algebra / 61 recent questions
MathematicsAlgebra2022-2026
Practice 61 MHT CET Mathematics questions from Linear Programming. Use the year-wise and type-wise breakdown to prioritize recent PYQs, then continue into the question list below.
61
PYQs on Page
Mathematics / Algebra
2022-2026
Year Range
Based on indexed question metadata
61
Last 5 Years
2022-2026
61
Last 10 Years
2017-2026
Recent Year Trend
2022
2023
2024
2025
2026Latest year
202217 max PYQs/year2026
Question Types
61PYQs
MCQ100%
Difficulty Mix
#1 Unknown61
61 in last 5 years61 in last 10 years
Last 5 Years Linear Programming Questions
Showing 11 of 61 filtered questions.
1Linear Programming
The solution set of the inequalities \(4 x+3 y \leq 60, y \geq 2 x, x \geq 3, x, y \geq 0\) is represented by region
MCQ+2 / -02023
2Linear Programming
The shaded region in the following figure represents the solution set for a certain linear programming problem. Then linear constraints for this region are given by
MCQ+2 / -02023
3Linear Programming
If feasible region is as shown in the figure, then related inequalities are
MCQ+2 / -02023
4Linear Programming
The shaded area in the given figure is a solution set for some system of inequations. The maximum value of the function \(z=10 x+25 y\) subject to the linear constraints given by the system is
MCQ+2 / -02023
5Linear Programming
For a feasible region OCDBO given below, the maximum value of the objective function \(z=3 x+4 y\) is
MCQ+2 / -02023
6Linear Programming
The maximum value of \(z=7 x+8 y\) subject to the constraints \(x+y \leq 20, y \geq 5, x \leq 10, x \geq 0, y \geq 0\) is
MCQ+2 / -02023
7Linear Programming
For the following shaded area, the linear constraints except \(x,y \ge 0\) are
MCQ+2 / -02023
8Linear Programming
The maximum value of \(z=3 x+5 y\) subject to the constraints \(3 x+2 y \leq 18, x \leq 4, y \leq 6, x, y \geq 0\), is
MCQ+2 / -02023
9Linear Programming
The vertices of the feasible region for the constraints \(x+y \leq 4, x \leq 2, y \leq 1, x+y \geq 1, x, y \geq 0\) are
MCQ+2 / -02023
10Linear Programming
The shaded area in the figure given below is a solution set of a system of inequations. The minimum value of objective function \(3 x+5 y\), subject to the linear constraints given by this system of inequations is
MCQ+2 / -02023
11Linear Programming
Maximum value of \(Z=5 x+2 y\), subject to \(2 x-y \geq 2, x+2 y \leq 8\) and \(x, y \geq 0\) is
MCQ+2 / -02022