Linear Programming PYQs - Last 5 Years

MHT CET / Mathematics / Algebra / 61 recent questions

MathematicsAlgebra2022-2026

All Linear Programming PYQs Last 10 Years Create chapter test

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

2026

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 50 of 61 filtered questions.

1Linear Programming

The difference between the maximum value and the minimum value of the objective function $z = 3x + y$ subject to the constraints $2x + 3y \leq 6$, $x + y \geq 1$, $x \geq 0$, $y \geq 0$ is....

2Linear Programming

The LPP maximize $z = 2x + 5y$ subject to $x + 3y \leq 6$, $2x + 6y \leq 18$, $x \geq 0$, $y \geq 0$ has

3Linear Programming

The shaded region in the provided graph represents the solution set for which of the following systems of linear inequalities?

4Linear Programming

An airplane can carry a maximum of $250$ passengers. A profit of Rs $1500$ is made on each executive class ticket and a profit of Rs $900$ is made on each economy class ticket. The airline reserves at least $30$ seats for executive class. H...

5Linear Programming

The maximum value of $Z = 4x + 5y$, subject to the constraints $3x + y \leq 15, 3x + 4y \leq 24, x \geq 0, y \geq 0$ is

6Linear Programming

The maximum value of $z = 4x + y$ subject to the constraints $x + y \leq 5, 2x + y \leq 7, 3x + 2y \leq 11, x \geq 0, y \geq 0$ is $\ldots$

7Linear Programming

The region satisfying the inequalities $y - x \geq 2,\ x + y \leq 5,\ x \geq 0$ and $y \geq 0$ is

8Linear Programming

For the linear programming problem, $x + 2y \leq 10,\ 3x + y \leq 12,\ x, y \geq 0$, the maximum value of $z = 5x + 10y$ occurs at every point on the line segment joining the points..

9Linear Programming

In the following figure, the shaded region represents the system of constraints:

10Linear Programming

The feasible region represented by the constraints $y - 2x \leq 4, x + y \geq 5, x \leq 4, y \geq 2, x, y \geq 0$ is ...........

11Linear Programming

The minimum value of $z = 3x + 5y$, subject to constraints $x \leq 80$, $y \geq 60$, $x + y \leq 200$ & $x, y \geq 0$ occurs at the point...

12Linear Programming

The minimum value of $Z = 3x + y$, subject to the constraints $2x + 3y \leq 6, x + y \geq 1, x \geq 0, y \geq 0$ is....

13Linear Programming

The difference between the maximum and minimum values of the objective function $Z = 3x + 5y$, subject to the constraints $x + 3y \leq 60$, $x + y \geq 10$, $x - y \leq 0$, $x, y \geq 0$ is

14Linear Programming

In L.P.P., the corner points of the feasible region for the constraints $3x - y \geq 6, x \leq 3, y \leq 2, y \geq 0, x \geq 0$ are .....

15Linear Programming

The difference between the maximum value and minimum value of the objective function $z = 3x + 5y$ of a linear programming problem subject to constraints $5x + 10y \leq 50$, $x + y \geq 1$, $y \leq 4$ and $x \geq 0, y \geq 0$ is $3\lambda$....

16Linear Programming

The point at which the maximum value of $x + y$ subject to constraints $x + 2y \leq 70$ and $2x + y \leq 95, x \geq 0, y \geq 0$ is.

17Linear Programming

The corner points of the feasible region determined by a system of linear constraints are $(0, 3), (1, 1)$ and $(3, 0)$. If the objective function is $z = px + qy$, where $p, q > 0$, then the condition on p and q such that the minimum of z ...

18Linear Programming

The feasible region for the constraints $x-y \geq 0, x-5 y \leq-5, x \geq 0, y \geq 0$ is shown by the figure:

19Linear Programming

The solution for minimizing the function $\mathrm{z}=x+y$ under an L.P.P. with constraints $x+y \geq 2, x+2 y \leq 8, y \leq 3, x, y \geq 0$ is

20Linear Programming

A manufacturing company produces two items, A and B. Each toy should be processed by two machines, I and II. Machine I can be operated for maximum 10 hours 40 minutes. It takes 20 minutes for an item of A and 15 minutes for B. Machine II ca...

21Linear Programming

The solution set of the constraints $|x-y| \leq 1, x, y \geq 0$ is

22Linear Programming

In L.P.P., the maximum value of objective function $\mathrm{Z}=6 x+3 y$ subject to constraints $x+y \leq 5, x+2 y \geq 4,4 x+y \leq 12, x, y \geq 0$ is

23Linear Programming

The graph with correct feasible region of L.P.P. for the constraints $2 x+y \leqslant 10, y \leqslant x, y \leqslant 2, x, y \geqslant 0$ is …

24Linear Programming

The difference between the maximum value and minimum value of objective function $\mathrm{z}=3 x+5 y$ subject to constraints $x+3 y \leq 60$, $x+y \geq 10, x-y \geq 0, x, y \geq 0$ is

25Linear Programming

If the difference between the maximum and minimum values of the objective function $\mathrm{z}=7 x-8 y$, subject to the constraints $x+y \leqslant 20, y \geqslant 5, x, y \geqslant 0$ is $5 \mathrm{k}+200$, then the value of k is

26Linear Programming

The correct constraints for the given feasible region are ….

27Linear Programming

The L.P.P. , minimize $z=30 x+20 y, x+y \leq 8$, $x+2 y \geq 4,6 x+4 y \geq 12, x \geqslant 0, y \geqslant 0$ has

28Linear Programming

The solution set for minimizing the function $\mathrm{z}=x+y$ with constraints $x+y \geqslant 2, x+2 y \leqslant 8, y \leqslant 3, x, y \geqslant 0$ contains

29Linear Programming

The shaded region in the following figure represents a solution set of

30Linear Programming

A scholarship amount is given by $\mathrm{z}=550 x+300 y$ and is to be distributed among $x$ boys and $y$ girls. From the graph given below the maximum amount of scholarship is __________

31Linear Programming

The feasible region represented by the given constraints $2 x+3 y \geq 12,-x+y \leq 3, x \leq 4, y \geq 3$ is denoted by

32Linear Programming

The feasible region for the constraints $x-2 \leqslant y, x \geqslant y-1, x \geqslant 2, y \leqslant 4, x, y \geqslant 0$, is _________

33Linear Programming

The maximum value of $z=x+y$, subjected to $x+y \leq 10,5 x+3 y \geq 15, x \leq 6, x, y \geq 0$

34Linear Programming

The maximum value of $z=4 x+2 y$, subject to the constraints $3 x+4 y \geqslant 12, x+y \leqslant 5, x, y \geqslant 0$ is

35Linear Programming

The shaded region in the following figure is the solution set of the inequations

36Linear Programming

The maximum value of the objective function $\mathrm{z}=4 x+6 y$ subject to $3 x+2 y \leq 12, x+y \geq 4, x$, $y \geq 0$ is

37Linear Programming

The shaded area in the figure below is the solution set for a certain linear programming problem, then the linear constraints are given by

38Linear Programming

The maximum value of $\mathrm{Z}=x+y$, subjected to $x+y \leq 10,5 x+3 y \geq 15, x \leq 6, x, y \geq 0$

39Linear Programming

The point, at which the maximum value of $10 x+6 y$ subject to the constraints $x+y \leq 12$, $2 x+y \leq 20, x \geq 0, y \geq 0$ occurs, is

40Linear Programming

The shaded region in the following figure is the solution set of the inequations

41Linear Programming

Maximum value of $Z=100 x+70 y$
Subject to $2 x \geq 4, y \leq 3, x+y \leq 8, x, y \geq 0$ is

42Linear Programming

The shaded area in the given figure is a solution set for some system of inequalities. The maximum value of the function $\mathrm{z}=4 x+3 y$ subject to linear constraints given by the system is

43Linear Programming

The region represented by the inequations $2 x+3 y \leqslant 18, x+y \geqslant 10, x \geqslant 0, y \geqslant 0$ is

44Linear Programming

The graphical solution set of the system of inequations $2 x+3 y \leq 6, x+4 y \geq 4, x \geq 0, y \geq 0$ is given by

45Linear Programming

For the following shaded region, the linear constraints are

46Linear Programming

A production unit makes special type of metal chips by combining copper and brass. The standard weight of the chip must be at least 5 gms. The basic ingredients i.e. copper and brass cost ₹8 and ₹ 5 per gm. The durability considerations dic...

47Linear Programming

The function to be maximized is given by $Z=3 x+2 y$. The feasible region for this function is the shaded region given below, then the linear constraints for this region are given by

48Linear Programming

The graphical solution set of the system of inequations $x+y \geq 1,7 x+9 y \leq 63, y \leq 5, x \leq 6$, $x \geq 0, y \geq 0$ is represented by

49Linear Programming

If feasible region is as shown in the figure, then the related inequalities are

50Linear Programming

The graphical solution set for the system of inequations
\(x-2 y \leq 2,5 x+2 y \geq 10,4 x+5 y \leq 20, x \geq 0, y \geq 0\) is given by