Linear Programming PYQs - Last 10 Years
KCET / Mathematics / Algebra / 16 recent questions
MathematicsAlgebra2017-2026
Practice 16 KCET Mathematics questions from Linear Programming. Use the year-wise and type-wise breakdown to prioritize recent PYQs, then continue into the question list below.
16
PYQs on Page
Mathematics / Algebra
2017-2026
Year Range
Based on indexed question metadata
8
Last 5 Years
2022-2026
16
Last 10 Years
2017-2026
Recent Year Trend
2021
2022
2023
2024
2025
2026Latest year
20212 max PYQs/year2026
Question Types
16PYQs
MCQ100%
Difficulty Mix
#1 Unknown16
8 in last 5 years16 in last 10 years
Last 10 Years Linear Programming Questions
Showing 16 of 16 filtered questions.
1Linear Programming
The corner points of the feasible region determined by the system of linear constraints are $(0, 10), (5, 5), (15, 15), (0, 20)$. Let $z = px + qy$ where $p, q > 0$. The relation between $p$ and $q$, so that the maximum $z$ occurs at both p...
MCQ+1 / -02026
2Linear Programming
In Linear Programming Problem (LPP), the objective function $Z = ax + by$ has the same maximum value at two corner points. The number of points at which $Z_{max}$ occurs is
MCQ+1 / -02026
3Linear Programming
The maximum value of $\mathrm{z}=3 \mathrm{x}+4 \mathrm{y}$, subject to the constraints $\mathrm{x}+\mathrm{y} \leq 40, \mathrm{x}+2 \mathrm{y} \leq 60$ and $\mathrm{x}, \mathrm{y} \geq 0$ is
MCQ+1 / -02025
4Linear Programming
Consider the following statements:
Statement (I): In a LPP, the objective function is always linear.
Statement (II): Ina LPP, the linear inequalities on variables are called constraints. Which of the following is correct?
Statement (I): In a LPP, the objective function is always linear.
Statement (II): Ina LPP, the linear inequalities on variables are called constraints. Which of the following is correct?
MCQ+1 / -02025
5Linear Programming
Corner points of the feasible region for an LPP are $(0,2),(3,0),(6,0),(6,8)$ and $(0,5)$. Let $Z=4 x+6 y$ be the objective function. The minimum value of $z$ occurs at
MCQ+1 / -02024
6Linear Programming
The shaded region in the figure given is the solution of which of the inequations?
MCQ+1 / -02023
7Linear Programming
A dietician has to develop a special diet using two foods \(X\) and \(Y\). Each packet (containing \(30 \mathrm{~g}\) ) of food. \(X\) contains 12 units of calcium, 4 units of iron, 6 units of cholesterol and 6 units of vitamin A. Each pack...
MCQ+1 / -02022
8Linear Programming
The corner points of the feasible region of an LPP are \((0,2),(3,0),(6,0),(6,8)\) and \((0,5)\), then the minimum value of \(z=4 x+6 y\) occurs at
MCQ+1 / -02022
9Linear Programming
The shaded region is the solution set of the inequalities
MCQ+1 / -02021
10Linear Programming
The feasible region of an LPP is shown in the figure. If \(z=11 x+7 y\), then the maximum value of \(Z\) occurs at
MCQ+1 / -02020
11Linear Programming
Corner points of the feasible region determined by the system of linear constraints are \((0,3),(1,1)\) and \((3,0)\). Let \(z=p x=q y\), where, \(p, q>0\). Condition on \(p\) and \(q\), so that the minimum of \(z\) occurs at \((3,0)\) and ...
MCQ+1 / -02020
12Linear Programming
The shaded region in the figure is the solution set of the inequations.
MCQ+1 / -02019
13Linear Programming
For the LPP, maximize $z=x+4 y$ subject to the constraints $x+2 y \leq 2, x+2 y \geq 8, x, y \geq 0$
MCQ+1 / -02018
14Linear Programming
The feasible region of an LPP is shown in the figure. If $z=3 x+9 y$, then the minimum value of $z$ occurs at
MCQ+1 / -02018
15Linear Programming
If an LPP admits optimal solution at two consecutive vertices of a feasible region, then
MCQ+1 / -02017
16Linear Programming
The shaded region in the figure is the solution set of the inequations
MCQ+1 / -02017