Opening your dashboard
Class 12 Maths Ch 12 Ex 12.1: Linear Programming Solutions
10 questions from Exercise 12.1 of Class 12 Maths Chapter 12, Linear Programming, each solved step by step. Free to read, CBSE 2026-27.
10 questions with solutions
3 marks · Easy difficulty
- 13 marks
Exercise 12.1 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
Exercise 12.1 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
Exercise 12.1 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
Exercise 12.1 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
Exercise 12.1 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
Exercise 12.1 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
Exercise 12.1 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
Exercise 12.1 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
Exercise 12.1 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
Exercise 12.1 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.
Stuck on one of these? Work it through out loud
A finished solution tells you the answer. The AI tutor takes one question of Ex 12.1 at a time and works it with you until you can do the next one on your own.
- Ask it out loud, in your own words
- It gives you the next step, not the answer
- Stuck on part (ii)? Start there
What students ask about Ex 12.1
How many questions are in Ex 12.1 of Class 12 Maths?
Ex 12.1 has 10 questions. Every one is solved step by step on this page, free to read.
How many marks is Ex 12.1 worth?
The 10 questions here carry 30 marks between them, at easy difficulty overall. Marks are shown on each question so you can see what a full answer needs.
Are these Ex 12.1 solutions free?
Yes. Every question and its full working is free to read, with no account needed.
Can I download Ex 12.1 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 2026-27 syllabus, and readable on a phone. Use your browser's print option if you want it on paper.
