Difficulty distribution
How the classified questions are distributed by difficulty.
1questions
Not classified
1
100%
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.
1Papers
1Years
1Questions
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.
Question type distribution
MCQ, numerical, multiple-select and other formats found in these papers.
1questions
Multiple Choices
1
100%
Subject weightage
Top subjects by unique question coverage.
Most asked topics
Top topics across the included previous year papers.
Subtopic coverage
Top subtopics inside this exact selection.
Paper coverage
Question coverage for the most populated papers. Every active PYP paper remains listed below.
Included previous year papers
Newest papers appear first. Sort by year, question coverage or name.
| Paper | Year / session | Questions in this view | Open |
|---|---|---|---|
| IAT IISER 2023 | 2023 | 1 | View paper |
All Linear Programming previous year questions
Practice every matching question in batches of 20, with every available option.
2023 · Mathematics · Algebra · Linear Programming
IAT IISER 2023
Consider the objective function $Z=x-y$ subject to the constraints
$$\begin{aligned} & x+2 y \leq 10 \\ & x+y \geq 2 \\ & x \geq 0, y \geq 0 \end{aligned}$$
What is the minimum value of $Z$ subject to the above constraints?