Multiple Choice Questions (MCQs) for BITSAT Mathematics: Linear Programming
Review structured MCQ sets for BITSAT Mathematics Linear Programming. Built according to official BITSAT guidelines, these downloadable questions support daily revision and core concept reinforcement.
Practice Linear Programming MCQs for BITSAT Mathematics
View or download the dedicated Linear Programming MCQ resource below. Practicing these 50 objective questions regularly builds familiarity with standard exam patterns and helps secure higher marks in final Mathematics evaluations.
Question: The maximum value of z = 3x + 2y subject to x + 2y≥ 2, x + 2y ≤ 8, x, y ≥ 0 is :
- a) 32
- b) 24
- c) 40
- d) None of these
Answer: 24
Question: Minimise 
Subject to
is a LPP with number of constraints
- a) m – n
- b) mn
- c) m + n
- d) m/n
Answer: m + n
Question: Consider
Then number of possible solutions are :
- a) Zero
- b) Unique
- c) Infinite
- d) None of these
Answer: Infinite
Question: A shopkeeper wants to purchase two article A and B of cost price ₹ 4 and 3 respectively. He thought that he may earn 30 paise by selling article A and 10 paise by selling article B. He has not to purchase total article worth more than ₹ 24. If he purchases the number of articles of A and B, x and y respectively, then linear constraints are
- a) x ≥ 0, y≤ 0, 4x +3 y ≥ 24
- b) x ≥ 0, y ≥ 0, 30x + 10 y ≤ 24
- c) x ≥ 0, y ≥ 0, 4x +3 y ≥ 24
- d) x ≥ 0, y ≥0, 30x +40 y ≥ 24
Answer: x ≥ 0, y≤ 0, 4x +3 y ≥ 24
Question: 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 ₹ 2000 in saving certificates and ₹ 2500 in national saving bonds. The interest rate is 8% on saving certificate and 10% on national saving bonds per annum. He invest ₹ x in saving certificate and ₹ y in national saving bonds. Then the objective function for this problem is
- a) 0.08 x + 0.10 y
- b)
- c) 2000x + 2500 y
- d)
Answer: 0.08 x + 0.10 y
Question: For the constraints of a L.P. Problem given by x1 + 2x2 ≤ 2000, x1 + x2 ≤ 1500 and x 2 ≤ 600 and x1, x2 ≥ 0, which one of the following points does not lie in the positive bounded region
- a) (1000, 0)
- b) (0, 500)
- c) (2, 0)
- d) (2000, 0)
Answer: (2000, 0)
Question: 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 store x quintal rice and y quintal wheat, then for maximum profit the objective function is
- a) 25 x + 40 y
- b) 40x + 25 y
- c) 400x + 600y
- d)
Answer: 40x + 25 y
Question: The minimum value of the function z = 4x + 3y subject to the constraints 3x + 2y ≥ 160, 5x + 2y ≥ 200, x + 2y ³ 80, x ≥ 0, y ≥ 0 is
- a) 320
- b) 300
- c) 220
- d) 200
Answer: 220
Question: The constraints –x1 + x2 ≤ 1, –x1 +3x2 ≤ 9, x1,x2 ≥ 0 define on
- a) Bounded feasible space.
- b) Unbounded feasible space
- c) Both bounded and unbounded feasible space.
- d) None of these
Answer: Unbounded feasible space
Question: The maximum value of z = 3x + 4y subject to the constraints x + y ≤ 40, x + 2y ≤ 60, x ≥ 0, y ≥ 0 is
- a) 120
- b) 140
- c) 100
- d) 160
Answer: 140
Question: The maximum value of z = 3x + 4y subject to the condition x + y ≤ 40 , x + 2y ≤ 60, x,y ≥ 0 is
- a) 130
- b) 120
- c) 40
- d) 140
Answer: 140
Question: The point at which the maximum value of ( 3x + 2y) subject to the constraints x + y ≤ 2, x ≥ 0, y ≥0 is obtained, is
- a) (0, 0)
- b) (1.5, 1.5)
- c) (2, 0)
- d) (0, 2)
Answer: (2, 0)
Question: The solution set of constraints x + 2y ≥ 11, 3x + 4y ≤ 30, 2x + 5y ≤ 30 and x ≥ 0 , y ≥ 0 , includes the point
- a) (2, 3)
- b) (3, 2)
- c) (3, 4)
- d) (4, 3)
Answer: (3, 4)
Question: The maximum value of z = 3x + 2y subject to x + 2y≥ 2, x + 2y ≤ 8, x, y ≥ 0 is :
- a) 32
- b) 24
- c) 40
- d) None of these
Answer: 24
Question: Minimise
Subject to
is a LPP with number of constraints
- a) m – n
- b) mn
- c) m + n
- d)
Answer: m + n
Free study material for Mathematics
Download Chapter MCQs: BITSAT Mathematics Linear Programming
About Linear Programming MCQs for BITSAT Mathematics
Test your conceptual understanding of Linear Programming with these targeted multiple-choice questions. Designed in alignment with the latest BITSAT curriculum for BITSAT Mathematics, these problem sets build accuracy and prepare students for objective exams.
How to Verify Your MCQ Answers
Cross-reference your completed choices with comprehensive NCERT solutions for BITSAT Mathematics to ensure absolute clarity across all sub-topics in this chapter.
Enhance Speed with Online MCQ Tests
Wrap up your chapter revision by testing your knowledge against standard question formats. Everything on our platform is provided free of charge.
FAQs
You can get most exhaustive BITSAT Mathematics Linear Programming MCQs for free on StudiesToday.com. These MCQs for BITSAT Mathematics are updated for the 2026-27 academic session as per BITSAT examination standards.
Yes, our BITSAT Mathematics Linear Programming MCQs include the latest type of questions, such as Assertion-Reasoning and Case-based MCQs. 50% of the BITSAT paper is now competency-based.
By solving our BITSAT Mathematics Linear Programming MCQs, BITSAT students can improve their accuracy and speed which is important as objective questions provide a chance to secure 100% marks in the Mathematics.
Yes, Mathematics MCQs for BITSAT have answer key and brief explanations to help students understand logic behind the correct option as its important for 2026 competency-focused BITSAT exams.
Yes, you can also access online interactive tests for BITSAT Mathematics Linear Programming MCQs on StudiesToday.com as they provide instant answers and score to help you track your progress in Mathematics.