Linear Programming PYQs - Last 10 Years

MHT CET / Mathematics / Algebra / 80 recent questions

MathematicsAlgebra2017-2026

All Linear Programming PYQs Last 5 Years Create chapter test

Practice 80 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.

80

PYQs on Page

Mathematics / Algebra

2019-2026

Year Range

Based on indexed question metadata

61

Last 5 Years

2022-2026

80

Last 10 Years

2017-2026

Recent Year Trend

2021

2022

2023

2024

2025

2026

202117 max PYQs/year2026

Question Types

80PYQs

MCQ100%

Difficulty Mix

#1 Unknown80

61 in last 5 years80 in last 10 years

Last 10 Years Linear Programming Questions

Showing 30 of 80 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

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

3Linear Programming

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

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

5Linear Programming

For a feasible region OCDBO given below, the maximum value of the objective function \(z=3 x+4 y\) is

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

7Linear Programming

For the following shaded area, the linear constraints except \(x,y \ge 0\) are

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

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

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

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

12Linear Programming

The common region of the solutions of the inequations \(x+2 y \geq 4,2 x-y \leq 6\) and \(x, y>0\) is

13Linear Programming

The region represented by the inequalities \(x \geq 6, y \geq 3,2 x+y \geq 10, x \geq 0, y \geq 0\) is

14Linear Programming

The maximum value of the objective function \(z=2 x+3 y\) subject to the constraints \(x+y \leq 5,2 x+y \geq 4\) and \(x \geq 0, y \geq 0\) is

15Linear Programming

The minimum value of the objective function \(z=4 x+6 y\) subject to \(x+2 y \geq 80,3 x+y \geq 75, x, y \geq 0\) is

16Linear Programming

The maximum value of \(z=10 x+25 y\) subject to \(0 \leq x \leq 3,0 \leq y \leq 3, x+y \leq 5\) occurs at the point.

17Linear Programming

The common region of the solution of the inequations \(x+y \geq 5, y \leq 4, x \geq 2, x, y \geq 0\) is

18Linear Programming

The shaded figure given below is the solution set for the linear inequations. Choose the correct option.

19Linear Programming

The objective function \(z=4 x+5 y\) subjective to \(2 x+y \geq 7 ; 2 x+3 y \leq 15 ; y \leq 3, x \geq 0 ; y \geq 0\) has minimum value at the point.

20Linear Programming

The shaded part of the given figure indicates the feasible region. Then the constraints are

21Linear Programming

The solution set for the system of linear inequations \(x+y \geq 1 ; 7 x+9 y \leq 63 ; y \leq 5 ; x \leq 6, x \geq 0\) and \(y \geq 0\) is represented graphically in the figure. What is the correct option?

22Linear Programming

The LPP to maximize $Z=x+y$, subject to $x+y \leq 1,2 x+2 y \geq 6, x \geq 0, y \geq 0$ has

23Linear Programming

The minimum value of \(Z=5 x+8 y\) subject to \(x+y \geq 5,0 \leq x \leq 4, y \geq 2, x \geq 0, y \geq 0\) is

24Linear Programming

The maximum value of \(Z=3 x+5 y\), subject to \(3 x+2 y \leq 18, x \leq 4, y \leq 6, x, y \geq 0\) is

25Linear Programming

If $z=a x+b y ; a, b>0$ subject to $x \leq 2, y \leq 2, x+y \geq 3, x \geq 0, y \geq 0$ has minimum value at $(2,1)$ only, then......

26Linear Programming

The maximum value of $Z=5 x+4 y$, Subject to $y \leq 2 x, x \leq 2 y, x+y \leq 3, x \geq 0, y \geq 0$ is ........

27Linear Programming

The minimum value of $z=10 x+25 y$ subject to $0 \leq x \leq 3,0 \leq y \leq 3, x+y \geq 5$ is $\ldots$

28Linear Programming

The maximum value of $z=9 x+11 y$ subject to $3 x+2 y \leq 12,2 x+3 y \leq 12, x \geq 0, y \geq 0$ is $\ldots \ldots$.

29Linear Programming

The maximum value of $z=6 x+8 y$ subject to $x-y \geq 0, x+3 y \leq 12, x \geq 0, y \geq 0$ is $\ldots \ldots$.

30Linear Programming

For L.P.P, maximize $z=4 x_1+2 x_2$ subject to $3 x_1+2 x_2 \geq 9, x_1-x_2 \leq 3, x_1 \geq 0, x_2 \geq 0$ has