Difficulty distribution
How the classified questions are distributed by difficulty.
2questions
Not classified
2
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.
2Papers
2Years
2Questions
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.
2questions
Multiple Choices
2
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 |
|---|---|---|---|
| BITSAT 2024 | 2024 | 1 | View paper |
| BITSAT 2021 | 2021 | 1 | View paper |
All Linear Programming previous year questions
Practice every matching question in batches of 20, with every available option.
2021 · Mathematics · Algebra · Linear Programming
BITSAT 2021
The linear programming problem minimize z = 3x + 2y subject to constrains x + y \(\ge\) 8, 3x + 5y \(\ge\) 15, x \(\ge\) 0 and y \(\ge\) 0, has
2024 · Mathematics · Algebra · Linear Programming
BITSAT 2024
If the number of available constraints is 3 and the number of parameters to be optimise is 4 , then
Open complete paper