My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

Linear Programming - Mathematics Previous Year Questions

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

19Papers
19Years
73Questions
1Topics

Linear Programming question pattern

Every graph below is calculated only from this selection.

Questions by year

Compare question counts across years.

Difficulty distribution

How the classified questions are distributed by difficulty.

Medium 46 63%
Easy 19 26%
Hard 8 11%

Question type distribution

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

MCQ 44 60.3%
Numerical Answer Type (NAT) 23 31.5%
MSQ 5 6.8%
Fill in the blanks 1 1.4%

Subject weightage

Top subjects by unique question coverage.

Mathematics
73 Qs

Most asked topics

Top topics across the included previous year papers.

Linear Programming
73 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Linear Programming and Simplex Methods
34 Qs
Duality
21 Qs
Transportation and Assignment Problems
18 Qs

Paper coverage

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

Mathematics (MA) 2026
4 Qs
Mathematics (MA) 2025
4 Qs
Mathematics (MA) 2024
2 Qs
Mathematics (MA) 2023
3 Qs
Mathematics (MA) 2022
5 Qs
Mathematics (MA) 2021
4 Qs
Mathematics (MA) 2020
4 Qs
Mathematics (MA) 2019
5 Qs
Mathematics (MA) 2018
3 Qs
Mathematics (MA) 2017
4 Qs
Mathematics (MA) 2016
2 Qs
Mathematics (MA) 2014
2 Qs
Mathematics (MA) 2013
4 Qs
Mathematics (MA) 2012
5 Qs
Mathematics (MA) 2011
4 Qs
Mathematics (MA) 2010
4 Qs
Mathematics (MA) 2009
5 Qs
Mathematics (MA) 2008
5 Qs
Mathematics (MA) 2007
4 Qs

Browse by subtopics

Open a focused page built from the same verified paper data.

Included previous year papers

Newest papers appear first. Search these papers or sort by year and name.

Paper nameYearPDFAttempt
Mathematics (MA) 20262026
4 questions in this view
2026
Mathematics (MA) 20252025
4 questions in this view
2025
Mathematics (MA) 20242024
2 questions in this view
2024
Mathematics (MA) 20232023
3 questions in this view
2023
Mathematics (MA) 20222022
5 questions in this view
2022
Mathematics (MA) 20212021
4 questions in this view
2021
Mathematics (MA) 20202020
4 questions in this view
2020
Mathematics (MA) 20192019
5 questions in this view
2019
Mathematics (MA) 20182018
3 questions in this view
2018
Mathematics (MA) 20172017
4 questions in this view
2017
Mathematics (MA) 20162016
2 questions in this view
2016
Mathematics (MA) 20142014
2 questions in this view
2014
Mathematics (MA) 20132013
4 questions in this view
2013
Mathematics (MA) 20122012
5 questions in this view
2012
Mathematics (MA) 20112011
4 questions in this view
2011
Mathematics (MA) 20102010
4 questions in this view
2010
Mathematics (MA) 20092009
5 questions in this view
2009
Mathematics (MA) 20082008
5 questions in this view
2008
Mathematics (MA) 20072007
4 questions in this view
2007

Sample previous year questions

A varied preview from the papers represented in this selection, with every available option.

1
2008 · Mathematics · Linear Programming · Transportation and Assignment Problems
Mathematics (MA) 2008
Let \(c_{ij} \ge 2\) be the cost of the \((i, j)^{th}\) cell of an assignment problem. If a new cost matrix is generated by the elements \(c'_{ij} = \frac{1}{2} c_{ij} + 1\), then
Open complete paper
2
2009 · Mathematics · Linear Programming · Linear Programming and Simplex Methods
Mathematics (MA) 2009

Which one of the following is TRUE?

Open complete paper
3
2010 · Mathematics · Linear Programming · Linear Programming and Simplex Methods
Mathematics (MA) 2010
For the linear programming problem
Minimize \( z = x - y \), subject to \( 2x + 3y \le 6 \), \( 0 \le x \le 3 \), \( 0 \le y \le 3 \),
the number of extreme points of its feasible region and the number of basic feasible solutions respectively, are
Open complete paper
4
2011 · Mathematics · Linear Programming · Linear Programming and Simplex Methods
Mathematics (MA) 2011
The Linear Programming Problem:
Maximize \( z = x_1 + x_2 \)
subject to
\( x_1 + 2x_2 \leq 20 \)
\( x_1 + x_2 \leq 15 \)
\( x_2 \leq 6 \)
\( x_1, x_2 \geq 0 \)
Open complete paper
5
2012 · Mathematics · Linear Programming · Linear Programming and Simplex Methods
Mathematics (MA) 2012
For the linear programming problem
Maximize \(z = x_1 + 2x_2 + 3x_3 - 4x_4\)
Subject to
\(2x_1 + 3x_2 - x_3 - x_4 = 15\)
\(6x_1 + x_2 + x_3 - 3x_4 = 21\)
\(8x_1 + 2x_2 + 3x_3 - 4x_4 = 30\)
\(x_1, x_2, x_3, x_4 \geq 0\),
\(x_1 = 4, x_2 = 3, x_3 = 0, x_4 = 2\) is
Open complete paper
6
2013 · Mathematics · Linear Programming · Linear Programming and Simplex Methods
Mathematics (MA) 2013
Consider the linear programming problem:
Maximize \(x + \frac{3}{2} y\)
subject to \(2x + 3y \le 16\), \(x + 4y \le 18\), \(x \ge 0, y \ge 0\).
If \(S\) denotes the set of all solutions of the above problem, then
Open complete paper