PracBeeLogin

Linear Programming

COMEDK / Mathematics / Algebra / 20 questions

MathematicsAlgebra20 PYQs

Practice 20 COMEDK Mathematics questions from Linear Programming. Use the year-wise and type-wise breakdown to prioritize recent PYQs, then continue into the question list below.

20
PYQs on Page
Mathematics / Algebra
2021-2026
Year Range
Based on indexed question metadata
17
Last 5 Years
2022-2026
20
Last 10 Years
2017-2026

Recent Year Trend

2021
2022
2023
2024
2025
2026Latest year
20214 max PYQs/year2026

Question Types

20PYQs
MCQ100%

Difficulty Mix

#1 Unknown20
17 in last 5 years20 in last 10 years

Linear Programming Questions

Showing 20 of 20 questions on this page.

1Linear Programming
"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...
MCQ+1 / -02026
2Linear Programming
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} $$
MCQ+1 / -02026
3Linear Programming
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} $$
MCQ+1 / -02026
4Linear Programming
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 ...
MCQ+1 / -02025
5Linear Programming
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
MCQ+1 / -02025
6Linear Programming
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
MCQ+1 / -02025
7Linear Programming
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...
MCQ+1 / -02025
8Linear Programming
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}$$
MCQ+1 / -02024
9Linear Programming
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
MCQ+1 / -02024
10Linear Programming
\(\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 }\)
MCQ+1 / -02024
11Linear Programming
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
MCQ+1 / -02023
12Linear Programming
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
MCQ+1 / -02023
13Linear Programming
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
MCQ+1 / -02023
14Linear Programming
The feasible region for the inequations \(x+2 y \geq 4,2 x+y \leq 6, x, y \geq 0\) is
MCQ+1 / -02023
15Linear Programming
Maximum value of \(z=12x+3y\), subject to constraints \(x\ge0,y\ge0,x+y\ge5\) and \(3x+y\le9\) is
MCQ+1 / -02022
16Linear Programming
The maximum of Z is where, \(Z=4x+2y\) subject to constraints \(4x+2y\ge46,x+3y\le24\) and \(x,y\ge0\) is
MCQ+1 / -02022
17Linear Programming
Shade the feasible region for the inequations \(6x+4y\le120, 3x+10y\le180,x,y\ge0\) in a rough figure.
MCQ+1 / -02022
18Linear Programming
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?
MCQ+1 / -02021
19Linear Programming
The maximum value of \(x+y\) subject to \(2x+3y\le6,x\ge0,y\ge0\) is
MCQ+1 / -02021
20Linear Programming
Shade the feasible region for the inequations \(x+y\ge2,2x+3y\le6,x\ge0,y\ge0\) in a rough figure.
MCQ+1 / -02021

Related Mathematics PYQs