BITSAT SERIES Mathematics
Linear Programming Problem
10 previous year questions.
Volume: 10 Ques
Yield: Medium
High-Yield Trend
1
2026 1
2021 1
2019 2
2018 1
2017 1
2015 1
2012 1
2011 1
2010 Chapter Questions 10 MCQs
01
PYQ 2010
medium
mathematics ID: bitsat-2
A wholesale merchant wants to start the business of cereal with ₹24000. Wheat is ₹400 per quintal and rice is ₹600 per quintal. He has capacity to store 200 quintal cereal. He earns the profit ₹25 per quintal on wheat and ₹40 per quintal on rice. If he stores x quintal rice and y quintal wheat, then maximum profit is the objective function
1
25x+40y
2
40x+25y
3
400x+600y
4
40x25+60025y
02
PYQ 2011
medium
mathematics ID: bitsat-2
The constraints of the L.P. problem given by x₁+2x₂\le2000, x₁+x₂\le1500 and x₂\le600, x₁,x₂\ge0, which of the following points does not lie in the positive bounded region?
1
(1000,0)
2
(0,500)
3
(2,0)
4
(2000,0)
03
PYQ 2012
medium
mathematics ID: bitsat-2
Prabhat wants to invest the total amount of ₹15,000 in saving certificates and national saving bonds. According to rules, he has to invest at least ₹2,000 in saving certificates and ₹2,500 in national saving bonds. The interest rate is 8% on saving certificates and 10% on national saving bonds per annum. He invests in saving certificate and in national saving bonds. Then the objective function for this problem is:
1
2
3
4
04
PYQ 2015
medium
mathematics ID: bitsat-2
Minimise
subject to
This is an LPP with number of constraints equal to
1
2
3
4
05
PYQ 2017
medium
mathematics ID: bitsat-2
The maximum value of subject to , , is
1
32
2
24
3
40
4
None of these
06
PYQ 2018
medium
mathematics ID: bitsat-2
If the constraints in a linear programming problem are changed then:
1
The problem is to be re-evaluated.
2
Solution is not defined.
3
The objective function has to be modified.
4
The change in constraints is ignored.
07
PYQ 2018
medium
mathematics ID: bitsat-2
Which of the following statements is correct?
1
Every L.P.P. admits an optimal solution.
2
A L.P.P. admits a unique optimal solution.
3
If a L.P.P. admits two optimal solutions, it has an infinite number of optimal solutions.
4
The set of all feasible solutions of a L.P.P. is a convex set.
08
PYQ 2019
medium
mathematics ID: bitsat-2
Minimise
Subject to:
This is a linear programming problem (LPP) with number of constraints:
Subject to:
This is a linear programming problem (LPP) with number of constraints:
1
2
3
4
(m)/(n)
09
PYQ 2021
medium
mathematics ID: bitsat-2
The maximum value of z=3x+2y subject to
x+2y\ge2, x+2y\le8, x,y\ge0
is
1
32
2
24
3
40
4
None of these
10
PYQ 2026
medium
mathematics ID: bitsat-2
In a Linear Programming Problem (LPP), the objective function Z is minimized subject to constraints. Where does the minimum value occur?
1
Inside feasible region
2
At corner points of feasible region
3
Outside feasible region
4
At origin only
About Linear Programming Problem - BITSAT
Linear Programming Problem is a vital chapter for BITSAT aspirants. Mastering the concepts covered in this chapter is essential for securing a top rank.
By rigorously practicing the previous year questions associated with this chapter, you can identify high-yield topics, understand the examiner's perspective, and boost your confidence during the actual exam.
Frequently Asked Questions
Why focus on Linear Programming Problem PYQs?
Analyzing PYQs for this specific chapter reveals the most frequently tested concepts and the typical complexity of questions, allowing you to tailor your study plan efficiently.
How to best use this analysis?
Review the topic breakdown to see which sub-topics within Linear Programming Problem carry the most weight. Then, tackle the questions iteratively to solidify your understanding.