Jump to a section

Mathematics - Linear Programming

Practise 27 COMEDK previous year questions on Linear Programming, compiled from papers spanning 2014 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 COMEDK tests.

Linear Programming has been asked in 8 of the 15 years of COMEDK papers analysed (2012–2026), with 27 questions in all. 44% of them were easy, 52% moderate and 4% tough. Most of its questions came from 2023, with 7 questions that year. In the last three years (2024–2026) it had 11 questions across 9 papers, about 1.2 per paper.

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

  1. 1Which of the following is NOT a corner point of the feasible region determined by the constraints: ; ; and09 May, 2026 (S1)Linear Programming
  2. 2The feasible region represented by the constraints: ; ; ; and09 May, 2026 (S2)Linear Programming
  3. 3The feasible region corresponding to the linear constraints of a Linear Programming problem is given below. Which of the following is NOT a 25 May, 2025 (Shift)Linear Programming
  4. 4For a given Linear Programming problem, the objective function is Subject to constraints are P is one of the corner points of the feasible r10 May, 2025 (S1)Linear Programming
  5. 5Given , subject to constraints are . P is one of the corner points of the feasible region for the given Linear Programming Problem. Then the10 May, 2025 (S3)Linear Programming
  6. 6Preview not available - open to view this question.2024 (Afternoon Shift)Linear Programming
  7. 7The maximum value of for the given constraints is2024 (Evening Shift)Linear Programming
  8. 8The maximum value of subjected to2024 (Memory Based)Linear Programming
  9. 9The feasible region for the inequations , is2024 (Memory Based)Linear Programming
  10. 10The maximum value of , subject to constraint is2024 (Memory Based)Linear Programming
  11. 11The minimum value of for the given constraints2024 (Morning Shift)Linear Programming
  12. 12The minimum value of , given subject to the constraints is2023 (Evening Shift)Linear Programming
  13. 13The feasible region for the inequations is2023 (Memory Based)Linear Programming
  14. 14The maximum value of , subject to constraints is2023 (Memory Based)Linear Programming
  15. 15The maximum value of , subject to constraints and is2023 (Memory Based)Linear Programming
  16. 16The maximum value of , subject to constraints and is2023 (Morning Shift)Linear Programming
  17. 17The feasible region for the inequations is2023 (Morning Shift)Linear Programming
  18. 18The maximum value of , subject to constraints is2023 (Morning Shift)Linear Programming
  19. 19Shade the feasible region for the inequations in a rough figure.2022Linear Programming
  20. 20The maximum of is where, subject to constraints and is2022Linear Programming
  21. 21Maximum value of , subject to constraints and is2022Linear Programming
  22. 22Shade the feasible region for the inequations in a rough figure.2021Linear Programming
  23. 23The maximum value of subject to is2021Linear Programming
  24. 24Write the solution of the following LPP Maximise Subject to . Which point the value of is maximum?2021Linear Programming
  25. 25Maximize subject to, .2017Linear Programming
  26. 26A mathematical model written to construct a maximum area rectangle out of a thread of length is given by maximise . Such that , where and ar2014Linear Programming
  27. 27Laksmi wants to buy few bangles and ear drops. Each bangle costs and each ear drop costs . She should buy atleast 6 bangles and atmost 2 ear2014Linear Programming

Frequently Asked Questions

1.How many questions are available for Linear Programming?

This chapter includes 27 questions compiled from COMEDK papers spanning 2014 to 2026.

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

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

Linear Programming has appeared in 8 of the 15 years of COMEDK papers covered here, with 27 questions across 16 papers - about 2 per paper it appears in.

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

Of the 27 questions analysed for this chapter, 44% are easy, 52% moderate and 4% tough. 2023 had the most, with 7 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 COMEDK going up or down?

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