Opening your dashboard
Class 12 Maths Chapter 12: Linear Programming Solutions
10 textbook questions with step-by-step answers, free to read, for CBSE 2026-27.
1 exercise in Ch 12
The numbered NCERT exercises, so you can open the one you were set rather than scrolling for it.
Get talked through Ch 12, not just shown the answer
Reading a finished solution is not the same as being able to do it. The AI tutor takes one question at a time and works it with you, in your own words, until you can.
- Ask it out loud, in your own words
- It gives you the next step, not the answer
- Stuck on part (ii)? Start there
More ways to study this chapter
The same chapter asked three other ways. Practise it, revise it, and see what the board has set on Ch 12 before.
- Competency-Based Questions (CBQ)The applied, case-study format that carries half the marks in a CBSE paper.80questionsOpen
- Previous Year QuestionsQuestions that have actually appeared in board papers, each tagged with its year.37questionsOpen
- Practice QuestionsExtra questions per chapter, for when one attempt at a method is not enough.30questionsOpen
10 questions with solutions
3 marks · Easy difficulty
Exercise 12.1
Open Exercise 12.1- 13 marks
Question 1
Maximise
Subject to the constraints:
.Solve with AIWritten solution
Solution:The feasible region determined by the constraints, , is given below.

The corner points of the feasible region are and . The values of at these points are given below:
Corner point 0 12 16 Hence, the maximum value of is 16 at the point .
- 23 marks
Question 2
Minimise
Subject to the constraints:
Solve with AIWritten solution
Solution:The feasible region determined by the system of constraints,
, is given below.
The corner points of the feasible region are and . The values of at these corner points are given below:
Corner point 0 -12 6 16 Hence, the minimum value of is -12 at the point .
- 33 marks
Question 3
Maximise
Subject to the constraints:
Solve with AIWritten solution
Solution:The feasible region determined by the system of constraints,
, is given below.
The corner points of the feasible region are and . The values of at these corner points are given below:
Corner point 0 10 9 Hence, the maximum value of is at the point .
- 43 marks
Question 4
Minimise
Subject to the constraints:
Solve with AIWritten solution
Solution:The feasible region determined by the system of constraints,
, is given below.
It can be seen that the feasible region is unbounded.
The corner points of the feasible region are and .
The values of at these corner points are given below:Corner point 9 7 (Smallest) 10 7 may or may not be the minimum value of because the feasible region is unbounded.
For this purpose, we draw the graph of the inequality, , and check whether the resulting half-plane has common points with the feasible region or not.
Hence, it can be seen that the feasible region has no common point with .
Thus, the minimum value of is 7 at point .
- 53 marks
Question 5
Maximise
Subject to the constraints:
Solve with AIWritten solution
Solution:The feasible region determined by the system of constraints,
, is given below.
The corner points of the feasible region are and .
The values of at these corner points are given below:Corner point 15 18 (Maximum) 10 0 Hence, the maximum value of is 18 at points .
- 63 marks
Question 6
Minimise
Subject to the constraints:
Solve with AIWritten solution
Solution:The feasible region determined by the constraints,
, is given below.
The corner points of the feasible region are and .
The values of at the corner points are given below:Corner point 6 6 Here, the values of at points and are the same. If we take any other point, such as on line , then .
Hence, the minimum value of occurs for more than 2 points.
The feasible region is unbounded, so we check the open half-plane : it has no point in common with the feasible region. Therefore, the minimum value of is 6, attained at every point of the line segment joining and .
- 73 marks
Question 7
Minimise and Maximise
Subject to the constraints:
Solve with AIWritten solution
Solution:The feasible region determined by the constraints,
, is given below.
The corner points of the feasible region are , , , and .
The values of at these corner points are given below:Corner point 300 Minimum 600 Maximum 600 Maximum 400 The minimum value of is 300 at and the maximum value of is 600 at all the points on the line segment joining and .
- 83 marks
Question 8
Minimise and Maximise subject to the constraints:
Solve with AIWritten solution
Solution:
The feasible region determined by the constraints, , is given below.
Corner points of the feasible region:
- are the corner points of the feasible region.
The values of at these corner points are given below:
Corner Point Minimum/Maximum A(0, 50) 100 Minimum B(20, 40) 100 Minimum C(50, 100) 250 D(0, 200) 400 Maximum The maximum value of is 400 at points , and the minimum value of is 100 at all the points on the line segment joining the points and .
- 93 marks
Question 9
Maximise , subject to the constraints:
Solve with AIWritten solution
Solution:
The feasible region determined by the constraints, , is given below.

Here, it can be seen that the feasible region is unbounded.
The values of at corner points A(6, 0), B(4, 1), and C(3, 2) are given below:
Corner Point A(6, 0) B(4, 1) C(3, 2) Since the feasible region is unbounded, may or may not be the maximum value.
For this purpose, we graph the inequality, , and check whether the resulting half-plane has points in common with the feasible region or not.
Here, the resulting feasible region has points in common with the feasible region.
Hence, is not the maximum value.
Thus, has no maximum value.
- 103 marks
Question 10
Maximise , subject to the constraints:
Solve with AIWritten solution
Solution:
The region determined by the constraints:
is given below.

There is no feasible region, and therefore, has no maximum value.
Ch 12 in past CBSE papers
The same chapter as the board has actually asked it. These are worded differently from the textbook exercise, which is the point of reading them.
- 11 mark
Board paper question 1
The objective function of an LPP has maximum value 42 at ( 4,6 ) and minimum value 19 at . Which of the following is true ?
Solve with AIAnswer
(A)
(B)
- Correct
(C)
(D)
Ans. (c)
- 21 mark
Board paper question 2
The corner points of the feasible region of a linear programming problem are and If is the objective function, then (maximum value of Z - minimum value of Z ) is equal to:
Solve with AIAnswer
(A) 40
(B) 96
(C) 120
- Correct
(D) 144
Ans. (d) 144
At : (Minimum)
At : (Maximum)
At :
- 31 mark
Board paper question 3
The corner points of the bounded feasible region determined by a system of linear constraints are and . Let , where 0 . The condition on and so that the minimum of Z occurs at and is
Solve with AIAnswer
(A)
- Correct
(B)
(C)
(D)
Ans. Option (B) is correct.
- 41 mark
Board paper question 4
The feasible region corresponding to the linear constraints of a Linear Programming Problem is given below.

Which of the following is not a constraint to the given Linear Programming Problem?
Solve with AIAnswer
(A)
(B)
- Correct
(C)
(D)
Option (C) is correct.
Take any point inside the shaded region, for example , and test each inequality:
(A) ✓
(B) ✓
(C) , which is not ✗
(D) ✓
A constraint must hold at every feasible point, so is not a constraint of this problem. The shaded region lies on the side of the line where (option D).
Hence, option (C) is correct.
- 51 mark
Board paper question 5
A linear programming problem (LPP) along with the graph of its constraints is shown below. The corresponding objective function is Minimize: The minimum value of the objective function is obtained at the corner point .

The optimal solution of the above linear programming problem
Solve with AIAnswer
(A) does not exist as the feasible region is unbounded.
(B) does not exist as the inequality does not have any point in common with the feasible region.
(C) exists as the inequality has infinitely many points in common with the feasible region.
- Correct
(D) exists as the inequality does not have any point in common with the feasible region.
Ans. Option (D) is correct.
- 61 mark
Board paper question 6
The feasible region of a linear programming problem is bounded. The corresponding objective function is .
The objective function attains in the feasible region.
Solve with AIAnswer
(A) only minimum
(B) only maximum
- Correct
(C) both maximum and minimum
(D) either maximum or minimum but not both
Ans. Option (C) is correct.
In linear programming, when the feasible region is bounded, the objective function can attain both a maximum and a minimum value. Since the feasible region is finite, the linear objective function will reach its extreme values at the vertices of the region.
Thus, the correct answer is:
Option (C): both maximum and minimum.
All 37 board paper questions for this chapter, solved the same way.
Class 12 Maths Ch 12 questions students ask
How many questions are there in Class 12 Maths Ch 12?
10 questions, across 1 exercise (Exercise 12.1). Every one is solved step by step on this page.
Are these Class 12 Maths solutions free?
Yes. Every question and its full working is free to read, with no account needed.
Can I download the Class 12 Maths Ch 12 solutions as a PDF?
There is no PDF to download. Every solution is on this page instead, which means it is searchable, always the current syllabus, and readable on a phone. Use your browser's print option if you want it on paper.
