Jump to a section

Mathematics - Linear Programming

Practise 11 BITSAT previous year questions on Linear Programming, compiled from papers spanning 2011 to 2024. Each question is pulled directly from the actual exam paper it appeared in, so you're practising in the exact style and difficulty BITSAT tests.

Linear Programming has been asked in 8 of the 16 years of BITSAT papers analysed (2009–2024), with 11 questions in all. 91% of them were easy, 9% moderate and 0% tough. Most of its questions came from 2023, with 2 questions that year. In the last three years (2022–2024) it had 3 questions across 3 papers, about 1 per paper.

All of the chapter's questions come from a single topic, Linear Programming.

  1. 1If the number of available constraints is 3 and the number of parameters to be optimise is 4 , then2024 (Memory Based Paper 3)Linear Programming
  2. 2The maximum value of subject to constraints2023 (Memory Based Paper 1)Linear Programming
  3. 3Minimum value of subject to constraints2023 (Memory Based Paper 2)Linear Programming
  4. 4The maximum value of subject to constraints and is2020Linear Programming
  5. 5The maximum value of Z = 4 x + 2 y subject to constraints 2 x + 3 y 18 , x + y 10 and x , y 0 is2018Linear Programming
  6. 6The coordinates of the point at which minimum value of Z = 7 x - 8 y subject to constraints x + y - 20 0 , y 5 , x 0 , y 0 is attained, is2018Linear Programming
  7. 7Minimise Subject to is a with number of constr2015Linear Programming
  8. 8Consider and . Then number of possible solutions are :2014Linear Programming
  9. 9A shopkeeper wants to purchase two articles A and of cost price 4 and 3 respectively. He thought that he mayearn 30 paise byselling article 2013Linear Programming
  10. 10Which 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\)2011Linear Programming
  11. 11For 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 fo2011Linear Programming

Frequently Asked Questions

1.How many questions are available for Linear Programming?

This chapter includes 11 questions compiled from BITSAT papers spanning 2011 to 2024.

2.Are these questions only from BITSAT, or from other exams too?

These are BITSAT questions specifically for the Linear Programming chapter. Questions from other exams like JEE Main or NTA Abhyas (JEE Main) are organised separately under their respective exam sections.

3.Is Linear Programming an important chapter for BITSAT Mathematics?

Linear Programming has appeared in 8 of the 16 years of BITSAT papers covered here, with 11 questions across 9 papers - about one per paper it appears in.

4.What is the difficulty level of Linear Programming questions in BITSAT?

Of the 11 questions analysed for this chapter, 91% are easy, 9% moderate and 0% tough. 2023 had the most, with 2 questions.

5.Which topics in Linear Programming should I focus on?

All of this chapter's questions come from a single topic: Linear Programming.

6.Is Linear Programming's weightage in BITSAT going up or down?

Across all 9 papers analysed, Linear Programming has averaged about 1.2 questions per paper. In the last three years (2022–2024), that average has fallen, at about 1.0 questions per paper. Use the year-wise numbers on this page for the exact trend before you decide how much time to give it.