Jump to a section

Mathematics - Linear Programming

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

Linear Programming has been asked in 12 of the 17 years of MHTCET papers analysed (2007–2026), with 103 questions in all. 50% of them were easy, 47% moderate and 3% tough. Most of its questions came from 2026, with 17 questions that year. In the last three years (2024–2026) it had 47 questions across 59 papers, about 0.8 per paper.

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

  1. 1The difference between the maximum value and the minimum value of the objective function subject to the constraints , , , is....20 Apr, 2026 (M)Linear Programming
  2. 2The LPP maximize subject to , , , has20 Apr, 2026 (E)Linear Programming
  3. 3The shaded region in the provided graph represents the solution set for which of the following systems of linear inequalities?19 Apr, 2026 (M)Linear Programming
  4. 4An airplane can carry a maximum of passengers. A profit of Rs is made on each executive class ticket and a profit of Rs is made on each econ19 Apr, 2026 (E)Linear Programming
  5. 5The maximum value of , subject to the constraints is18 Apr, 2026 (M)Linear Programming
  6. 6The maximum value of subject to the constraints is18 Apr, 2026 (E)Linear Programming
  7. 7The region satisfying the inequalities and is17 Apr, 2026 (M)Linear Programming
  8. 8For the linear programming problem, , the maximum value of occurs at every point on the line segment joining the points..17 Apr, 2026 (M)Linear Programming
  9. 9In the following figure, the shaded region represents the system of constraints:17 Apr, 2026 (E)Linear Programming
  10. 10The feasible region represented by the constraints is ...........16 Apr, 2026 (M)Linear Programming
  11. 11The minimum value of , subject to constraints , , & occurs at the point...16 Apr, 2026 (E)Linear Programming
  12. 12The minimum value of , subject to the constraints is....15 Apr, 2026 (M)Linear Programming
  13. 13The difference between the maximum and minimum values of the objective function , subject to the constraints , , , is15 Apr, 2026 (E)Linear Programming
  14. 14In L.P.P., the corner points of the feasible region for the constraints are .....13 Apr, 2026 (M)Linear Programming
  15. 15The difference between the maximum value and minimum value of the objective function of a linear programming problem subject to constraints 13 Apr, 2026 (E)Linear Programming
  16. 16The point at which the maximum value of subject to constraints and is.11 Apr, 2026 (M)Linear Programming
  17. 17The corner points of the feasible region determined by a system of linear constraints are and . If the objective function is , where , then 11 Apr, 2026 (E)Linear Programming
  18. 18The feasible region for the constraints is shown by the figure:05 May, 2025 (E)Linear Programming
  19. 19Maximum value of subject to is given by27 Apr, 2025 (E)Linear Programming
  20. 20The difference between the maximum and minimum values of the objective function , subject to the constraints , is27 Apr, 2025 (E)Linear Programming
  21. 21The solution for minimizing the function under an L.P.P. with constraints is26 Apr, 2025 (M)Linear Programming
  22. 22A manufacturing company produces two items, A and B. Each toy should be processed by two machines, I and II. Machine I can be operated for m26 Apr, 2025 (E)Linear Programming
  23. 23The solution set of the constraints is25 Apr, 2025 (M)Linear Programming
  24. 24In L.P.P. , the maximum value of objective function subject to constraints is25 Apr, 2025 (E)Linear Programming
  25. 25The graph with correct feasible region of L.P.P. for the constraints is23 Apr, 2025 (M)Linear Programming
  26. 26The difference between the maximum value and minimum value of objective function subject to constraints , is23 Apr, 2025 (E)Linear Programming
  27. 27If the difference between the maximum and minimum values of the objective function subject to the constraints , is , then the value of is22 Apr, 2025 (M)Linear Programming
  28. 28The correct constraints for the given feasible region are ....22 Apr, 2025 (E)Linear Programming
  29. 29The L.P.P. , minimize , has21 Apr, 2025 (M)Linear Programming
  30. 30The solution set for minimizing the function with constraints contains21 Apr, 2025 (E)Linear Programming
  31. 31A scholarship amount is given by and is to be distributed among boys and y girls. From the graph given below the maximum amount of scholarsh20 Apr, 2025 (E)Linear Programming
  32. 32The feasible region represented by the given constraints is denoted by19 Apr, 2025 (M)Linear Programming
  33. 33The feasible region for the constraints , , is ...19 Apr, 2025 (E)Linear Programming
  34. 34Maximum value of Subject to is16 May, 2024 (M)Linear Programming
  35. 35The shaded area in the given figure is a solution set for some system of inequalities. The maximum value of the function subject to linear c16 May, 2024 (E)Linear Programming
  36. 36The region represented by the inequations is15 May, 2024 (M)Linear Programming
  37. 37The graphical solution set of the system of inequations is given by15 May, 2024 (E)Linear Programming
  38. 38For the following shaded region, the linear constraints are11 May, 2024 (M)Linear Programming
  39. 39A production unit makes special type of metal chips by combining copper and brass. The standard weight of the chip must be at least 5 gms. T11 May, 2024 (E)Linear Programming
  40. 40The function to be maximized is given by . The feasible region for this function is the shaded region given below, then the linear constrain10 May, 2024 (M)Linear Programming
  41. 41The graphical solution set of the system of inequations , is represented by Fig. 210 May, 2024 (E)Linear Programming
  42. 42The maximum value of , subjected to09 May, 2024 (M)Linear Programming
  43. 43The maximum value of , subject to the constraints is09 May, 2024 (E)Linear Programming
  44. 44The maximum value of the objective function subject to , is04 May, 2024 (E)Linear Programming
  45. 45The shaded area in the figure below is the solution set for a certain linear programming problem, then the linear constraints are given by03 May, 2024 (M)Linear Programming
  46. 46The point, at which the maximum value of subject to the constraints , occurs, is02 May, 2024 (M)Linear Programming
  47. 47The shaded region in the following figure is the solution set of the inequations02 May, 2024 (E)Linear Programming
  48. 48The solution set of the inequalities is represented by region14 May, 2023 (M)Linear Programming
  49. 49The shaded region in the following figure represents the solution set for a certain linear programming problem. Then linear constraints for 14 May, 2023 (E)Linear Programming
  50. 50If feasible region is as shown in the figure, then related inequalities are13 May, 2023 (M)Linear Programming

Frequently Asked Questions

1.How many questions are available for Linear Programming?

This chapter includes 103 questions compiled from MHTCET papers spanning 2007 to 2026.

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

These are MHTCET 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 MHTCET Mathematics?

Linear Programming has appeared in 12 of the 17 years of MHTCET papers covered here, with 103 questions across 95 papers - about one per paper it appears in.

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

Of the 103 questions analysed for this chapter, 50% are easy, 47% moderate and 3% tough. 2026 had the most, with 17 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 MHTCET going up or down?

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