Mathematics - Linear Programming
Practise 17 KCET 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 KCET tests.
Linear Programming has been asked in 11 of the 20 years of KCET papers analysed (2007–2026), with 17 questions in all. 65% of them were easy, 24% moderate and 12% tough. Most of its questions came from 2026, with 2 questions that year. In the last three years (2024–2026) it had 5 questions across 3 papers, about 1.7 per paper.
All of the chapter's questions come from a single topic, Linear Programming.
- 1The corner points of the feasible region determined by the system of linear constraints are . Let where . The relation between and , so that2026Linear Programming
- 2In Linear Programming Problem (LPP), the objective function has the same maximum value at two corner points. The number of points at which o2026Linear Programming
- 3Consider the following statements: Statement (I): In a LPP, the objective function is always linear. Statement (II): In a LPP, the linear in2025Linear Programming
- 4The maximum value of , subject to the constraints and is2025Linear Programming
- 5Corner points of the feasible region for an LPP are and . Let be the objective function. The minimum value of occurs at2024Linear Programming
- 6The corner points of the feasible region of an LPP are and , then the minimum value of occurs at2022Linear Programming
- 7A dietician has to develop a special diet using two foods and . Each packet (containing ) of food. contains 12 units of calcium, 4 units of 2022Linear Programming
- 8The shaded region is the solution set of the inequalities2021Linear Programming
- 9The distance of the point from the line is2020Linear Programming
- 10The sine of the angle between the straight line and the plane is2020Linear Programming
- 11The shaded region in the figure is the solution set of the inequations2019Linear Programming
- 12The feasible region of an LPP is shown in the figure. If \( z=3 x+9 y \), then the minimum value of z occurs at2018Linear Programming
- 13For the LPP, maximize \( z=x+4 y \) subject to the constraints \( x+2 y 2, x+2 y 8, x, y 0 \)2018Linear Programming
- 14If \( A \) and \( B \) are finite sets and \( A B \), then2017Linear Programming
- 15If \( |x-2| 1 \), then2017Linear Programming
- 16Foot of perpendicular drawn from the origin to the plane \( 2 x-3 y+4 z=29 \) is2015Linear Programming
- 17If the coefficient of variation and standard deviation are \( 60 \) and \( 21 \) respectively, the arithmetic mean of distribution is2014Linear Programming
Frequently Asked Questions
1.How many questions are available for Linear Programming?
This chapter includes 17 questions compiled from KCET papers spanning 2014 to 2026.
2.Are these questions only from KCET, or from other exams too?
These are KCET 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 KCET Mathematics?
Linear Programming has appeared in 11 of the 20 years of KCET papers covered here, with 17 questions across 11 papers - about 2 per paper it appears in.
4.What is the difficulty level of Linear Programming questions in KCET?
Of the 17 questions analysed for this chapter, 65% are easy, 24% moderate and 12% tough. 2026 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 KCET going up or down?
Across all 11 papers analysed, Linear Programming has averaged about 1.5 questions per paper. In the last three years (2024–2026), that average has stayed about the same, at about 1.7 questions per paper. Use the year-wise numbers on this page for the exact trend before you decide how much time to give it.