Quantrex AcademyPYQs with solutions · JEE · NEET · NDA

Home · BITSAT PYQs · Mathematics · Linear Programming

BITSAT Linear Programming PYQs with Solutions

11 previous year questions from Linear Programming (BITSAT Mathematics) with answers and solutions. Numbered list, year tags, and one-tap solutions — built for serious JEE / NEET practice.

11 questionsMathematics2011–2024Answers + solutions

About Linear Programming PYQs

Linear Programming has 11 previous year questions in the Quantrex Academy BITSAT Mathematics bank. The 11 questions in this list come from BITSAT (11), spanning 2011 to 2024. Each question opens on its own page with the options, the correct answer and the worked solution where available.

Questions by year (this list)

2024: 1
2023: 2
2020: 1
2018: 2
2015: 1
2014: 1
2013: 1
2011: 2

Linear Programming questions with solutions

If the number of available constraints is 3 and the number of parameters to be optimise is 4 , then

BITSAT 2024 Solution View → 2

Minimum value of Z=3 x+5 y subject to constraints x+y ≥ 2, x+3 y ≥ 3, x, y ≥ 0

BITSAT 2023 Solution View → 3

The maximum value of z=5 x+2 y subject to constraints x+y ≤ 7, x+2 y ≤ 10, x, y ≥ 0

BITSAT 2023 Solution View → 4

The maximum value of z=6 x+8 y subject to constraints 2 x+y ≤ 30, x+2 y ≤ 24 and x ≥ 0, y ≥ 0 is

BITSAT 2020 Solution View → 5

The maximum value of Z = 4x + 2y subject to constraints 2x + 3y ≤ 18, x + y ≥ 10 and x, y ≥ 0 & is

BITSAT 2018 Solution View → 6

The coordinates of the point at which minimum value of Z = 7x - 8y subject to constraints x + y - 20 ≤ 0, y ≥ 5, x ≥ 0, y ≥ 0 & is attained, is

BITSAT 2018 Solution View → 7

Minimise Z=∑_ j=1 ^ n ∑_ i=1 ^ m c_ i j x_ i j Subject to ∑_ i=1 ^ m x_ i j =b_ j , j=1,2, …, n∑_ j=1 ^ n x_ i j =b_ j , i=1,2, …, m is a L P P with number of constr

BITSAT 2015 Solution View → 8

Consider (x)/(2)+(y)/(4) ≥ 1 and (x)/(3)+(y)/(2) ≤ 1, x, y ≥ 0 . Then number of possible solutions are :

BITSAT 2014 Solution View → 9

A shopkeeper wants to purchase two articles A and B of cost price 4 and 3 respectively. He thought that he mayearn 30 paise byselling article A and 10 paise by selling article B .

BITSAT 2013 Solution View → 10

Which of the following is not a vertex of the positive region bounded by the inqualities \(2 x+3 y ≤ 6,5 x+3 y ≤ 15\) and \(x, y ≥ 0\)

BITSAT 2011 Solution View → 11

For the constraints of a L.P. Problem given by \(x_1+2 x_2 ≤ 2000, x_1+x_2 ≤ 1500\) and \(x_2 ≤ 600\) and x_ 1 , x_ 2 ≥0\), which one of the following points does not lie in the

BITSAT 2011 Solution View →

Practice all Linear Programming questions in the app →

Related BITSAT Mathematics chapters

Application of Derivatives (67)Sequences and Series (51)Probability (44)Three Dimensional Geometry (40)Functions (39)Binomial Theorem (34)Permutation and Combination (31)Complex Number (30)Circle (27)Differential Equations (27)Straight Lines (27)Vector Algebra (25)