My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

Linear Programming - Algebra - Mathematics Previous Year Questions

Practice Linear Programming - Algebra - Mathematics previous year questions organised from real papers, with year-wise coverage and clear topic navigation.

12Papers
6Years
20Questions
1Topics

Linear Programming question pattern

Every graph below is calculated only from this selection.

Questions by year

Year-wise coverage for Linear Programming. Each bar uses a separate theme-derived color.

Difficulty distribution

How the classified questions are distributed by difficulty.

Not classified 20 100%

Question type distribution

MCQ, numerical, multiple-select and other formats found in these papers.

MCQ 20 100%

Subject weightage

Top subjects by unique question coverage.

Mathematics
20 Qs

Most asked topics

Top topics across the included previous year papers.

Algebra
20 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Linear Programming
20 Qs

Paper coverage

Question coverage for the most populated papers. Every active PYP paper remains listed below.

COMEDK 2026 Morning Shift
2 Qs
COMEDK 2026 Afternoon Shift
1 Qs
COMEDK 2025 EVENING SHIFT
2 Qs
COMEDK 2025 AFTERNOON SHIFT
1 Qs
COMEDK 2025 Morning Shift
1 Qs
COMEDK 2024 AFTERNOON SHIFT
1 Qs
COMEDK 2024 EVENING SHIFT
1 Qs
COMEDK 2024 MORNING SHIFT
1 Qs
COMEDK 2023 Morning Shift
3 Qs
COMEDK 2023 EVENING SHIFT
1 Qs
COMEDK 2022
3 Qs
COMEDK 2021
3 Qs

Included previous year papers

Newest papers appear first. Sort by year, question coverage or name.

PaperYear / sessionQuestions in this viewOpen
COMEDK 2026 Afternoon Shift20261View paper
COMEDK 2026 Morning Shift20262View paper
COMEDK 2025 AFTERNOON SHIFT20251View paper
COMEDK 2025 EVENING SHIFT20252View paper
COMEDK 2025 Morning Shift20251View paper
COMEDK 2024 AFTERNOON SHIFT20241View paper
COMEDK 2024 EVENING SHIFT20241View paper
COMEDK 2024 MORNING SHIFT20241View paper
COMEDK 2023 EVENING SHIFT20231View paper
COMEDK 2023 Morning Shift20233View paper
COMEDK 202220223View paper
COMEDK 202120213View paper

All Linear Programming previous year questions

Practice every matching question in batches of 20, with every available option.

1
2021 · Mathematics · Algebra · Linear Programming
COMEDK 2021

The maximum value of \(x+y\) subject to \(2x+3y\le6,x\ge0,y\ge0\) is

Open complete paper
2
2021 · Mathematics · Algebra · Linear Programming
COMEDK 2021

Write the solution of the following LPP

Maximize \(Z=x+y\)

Subject to \(3x+4y\le12,x\ge0,y\ge0\).

Which point the value of Z is maximum?

Open complete paper
3
2021 · Mathematics · Algebra · Linear Programming
COMEDK 2021

Shade the feasible region for the inequations \(x+y\ge2,2x+3y\le6,x\ge0,y\ge0\) in a rough figure.

Open complete paper
4
2022 · Mathematics · Algebra · Linear Programming
COMEDK 2022

Maximum value of \(z=12x+3y\), subject to constraints \(x\ge0,y\ge0,x+y\ge5\) and \(3x+y\le9\) is

Open complete paper
5
2022 · Mathematics · Algebra · Linear Programming
COMEDK 2022

Shade the feasible region for the inequations \(6x+4y\le120, 3x+10y\le180,x,y\ge0\) in a rough figure.

Open complete paper
6
2022 · Mathematics · Algebra · Linear Programming
COMEDK 2022

The maximum of Z is where, \(Z=4x+2y\) subject to constraints \(4x+2y\ge46,x+3y\le24\) and \(x,y\ge0\) is

Open complete paper
7
2023 · Mathematics · Algebra · Linear Programming
COMEDK 2023 EVENING SHIFT

The minimum value of \(Z=3 x+5 y\), given subject to the constraints \(x+y \geq 2, x+3 y \geq 3, x, y \geq 0\) is

Open complete paper
8
2024 · Mathematics · Algebra · Linear Programming
COMEDK 2024 AFTERNOON SHIFT

$$\text { The maximum value of } Z=3 x+4 y \text { for the given constraints } x+2 y \leq 76,2 x+y \leq 104, x \geq 0, y \geq 0 \text { is }$$

Open complete paper
9
2024 · Mathematics · Algebra · Linear Programming
COMEDK 2024 EVENING SHIFT

The maximum value of \(P=500 x+400 y\) for the given constraints \(x+y \leq 200, \quad x \geq 20, \quad y \geq 4 x, \quad y \geq 0\) is

Open complete paper
10
2024 · Mathematics · Algebra · Linear Programming
COMEDK 2024 MORNING SHIFT

The minimum value of \(Z=150 x+200 y\) for the given constraints

$$\begin{aligned} & 3 x+5 y \geq 30 \\ & x+y \geq 8 ; x \geq 0, y \geq 0 \text { is } \end{aligned}$$

Open complete paper
11
2025 · Mathematics · Algebra · Linear Programming
COMEDK 2025 AFTERNOON SHIFT
The corner points of the feasible region determined by the system of linear constraints are $(0,3),(1,1)$ and $(3,0)$, If objective function is $Z=p x+q y, p, q>0$ then the condition on $p$ and $q$ so that the minimum of $Z$ occurs at $(3,0)$ and $(1,1)$ is
Open complete paper
12
2025 · Mathematics · Algebra · Linear Programming
COMEDK 2025 EVENING SHIFT
Given $Z=80 x+120 y$, subject to constraints are $x+3 y \leq 30 ; 3 x+4 y \leq 60 ; x \geq 0 ; y \geq 0$. P is one of the corner points of the feasible region for the given Linear Programming Problem. Then the coordinate of $P$ is
Open complete paper
13
2025 · Mathematics · Algebra · Linear Programming
COMEDK 2025 EVENING SHIFT
The solution for the following system of inequalities $3 x-7<5+x$ and $11-5 x \leq 1$ on a real number line is
Open complete paper
14
2023 · Mathematics · Algebra · Linear Programming
COMEDK 2023 Morning Shift

The maximum value of \(Z=12 x+13 y\), subject to constraints \(x \geq 0, y \geq 0, x+y \leq 5\) and \(3 x+y \leq 9\) is

Open complete paper
15
2023 · Mathematics · Algebra · Linear Programming
COMEDK 2023 Morning Shift

The feasible region for the inequations \(x+2 y \geq 4,2 x+y \leq 6, x, y \geq 0\) is

Open complete paper
16
2023 · Mathematics · Algebra · Linear Programming
COMEDK 2023 Morning Shift

The maximum value of \(Z=10 x+16 y\), subject to constraints \(x \geq 0, y \geq 0, x+y \leq 12,2 x+y \leq 20\) is

Open complete paper
17
2025 · Mathematics · Algebra · Linear Programming
COMEDK 2025 Morning Shift

For a given Linear Programming problem, the objective function is

$$z=3 x+2 y$$

Subject to constraints are

$$\begin{aligned} & 4 x+3 y \leq 60 \\ & x \geq 3 \\ & y \leq 2 x \\ & y \geq 0 \end{aligned}$$

P is one of the corner points of the feasible region for the given Linear Programming problem. Then the coordinate of P is

Open complete paper
18
2026 · Mathematics · Algebra · Linear Programming
COMEDK 2026 Morning Shift

"A storage room must be kept at a temperature (T) such that triple the temperature is at least $\mathbf{1 5}^{\circ} \mathbf{C}$, but the temperature plus $\mathbf{8}$ is strictly not more than $\mathbf{2 0}^{\circ} \mathbf{C}$. What is the range of safe temperatures?"

Open complete paper
19
2026 · Mathematics · Algebra · Linear Programming
COMEDK 2026 Morning Shift

Which of the following is NOT a comer point of the feasible region determined by the constraints:

$$\begin{aligned} & x+2 y \leq 4 \\ & x+y \geq 2 \\ & x \geq 0 \text { and } y \geq 0 \end{aligned}$$

Open complete paper
20
2026 · Mathematics · Algebra · Linear Programming
COMEDK 2026 Afternoon Shift

The feasible region represented by the constraints:

$$\begin{aligned} & x+2 y \leq 120 \\ & x+y \geq 60 \\ & x-2 y \geq 0 \\ & x \geq 0 \text { and } y \geq 0 \end{aligned}$$

COMEDK 2026 Afternoon Shift Mathematics - Linear Programming Question 1 English
Open complete paper