Opening your dashboard
Class 12 Maths Chapter 12 Linear Programming: Previous Year Questions
37 questions on Chapter 12, each solved step by step. Class 12 Maths, CBSE 2026-27.
37 questions with solutions
1–5 marks · Mixed difficulty
The first 31 solutions are on this page. This chapter is a long one, so the rest open on their own page to keep this one quick to load.
- 11 mark
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
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
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
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
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
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.
- 71 mark
Question 7
The solution set of the inequation is
Solve with AIAnswer
(A) half plane containing the origin
- Correct
(B) half plane not containing the origin
(C) the point being on the line
(D) None of these
Answer:(B) half plane not containing the origin
Explanation:The inequality represents a region in the coordinate plane.
- The corresponding equation defines a straight line.
- The inequality refers to the region above this line (excluding the line itself).
To determine if the origin (0,0) is included in the solution set, substitute and into the inequality:
Since the origin does not satisfy the inequality, the solution set is the half-plane above the line that does not contain the origin.
Thus, the correct answer is (B).
- 81 mark
Question 8
The solution set of the inequality is
Solve with AIAnswer
(A) an open half-plane not containing the origin.
- Correct
(B) an open half-plane containing the origin.
(C) the whole XY -plane not containing the line .
(D) a closed half plane containing the origin.
Concept Applied Solution set containing origin in open half plane Ans. Option (B) is correct. Explanation: The strict inequality represents an open half plane and it contains the origin as satisfies it.
- 91 mark
Question 9
The corner points of the feasible region for the Linear Programming Problem are , and . Let the objective function is then the minimum value of the objective function occurs at
Solve with AIAnswer
(A) only
(B) only
(C) The mid-point on the line segment joining the points and
- Correct
(D) Any point on the line segment joining the points and
Answer: (D)
We are given the objective function:
The corner points of the feasible region are:
Now evaluate at each corner point:
Corner Point Value of The minimum value of is:
This minimum occurs at both:
Since the objective function has the same minimum value at two adjacent corner points, it will have the same minimum value at every point on the line segment joining those two points.
Therefore, the minimum occurs at:
So the correct option is:
- 101 mark
Question 10
The corner points of the shaded unbounded feasible region of an LPP are ( 0,4 ), ( ) and as shown in the figure. The minimum value of the objective function occurs at
Solve with AIAnswer
(A) only
(B) only
(C) and only
- Correct
(D) at every point of the line-segment joining the points and
Ans. Option (D) is correct. Explanation: The minimum value of the objective function occurs at two adjacent corner points ( ) and ( 3,0 ) and there is no point in the half plane in common with the feasible region. So, the minimum value occurs at every point of the line-segment joining the two points.
Note: the corner point printed as in the question should read , as in the options.
- 111 mark
Question 11
A Linear Programming Problem is as follows:
Minimise
Subject to the constraints
The feasible region has
Solve with AIAnswer
(A) 5 corner points including and
- Correct
(B) 5 corner points including and
(C) 5 corner points including and
(D) 5 corner points including ( 3,6 ) and ( 9,5 )
Ans. Option (B) is correct. Explanation:

On plotting the constraints and , we get the following graph. From the graph given below it, clear that feasible region is ABCDEA , including corner points , and . Thus feasible region has 5 corner points including and .
- 121 mark
Question 12
A Linear Programming Problem is as follows:
Maximise/Minimise objective function
Subject to the constraints
If the corner points of the feasible region are , , and , then which of the following is true?
Solve with AIAnswer
(A) Maximum value of is 40
- Correct
(B) Minimum value of is -5
(C) Difference of maximum and minimum values of is 35
(D) At two corner points, value of are equal
Option (B) is correct. Explanation:
Corner Points Value of (Minimum) (Maximum) The minimum value of is (at A) and the maximum is (at C). So (A) and (C) are false (maximum 45, difference 50), no two corner values are equal (D false), and (B) is true.
Hence, option (B) is correct.
- 131 mark
Question 13
The corner points of the feasible region determined by a set of constraints (linear inequalities) are , , and , and the objective function is , where . The condition on and such that the maximum of occurs at both Q and S is
(Adapted from CBSE 2021. The printed paper gave , which puts on the segment and leaves no correct option; is changed to .)
Solve with AIAnswer
(A)
(B)
(C)
- Correct
(D)
Option (D) is correct.
The values of at the corner points are:
Corner point For the maximum to occur at both Q and S, their values must be equal:
Check that this really is the maximum. With :
so the largest value, , occurs at Q and S (and along the edge QS joining them), as required.
The other options do not work: with , or , is larger than (, , ), so the maximum occurs at Q alone.
Hence, option (D) is correct.
- 141 mark
Question 14
For an L.P.P. the objective function is , and the feasible region determined by a set of constraints (linear in equations) is shown in the graph.

Which one of the following statements is true?
Solve with AIAnswer
(A) Maximum value of is at .
- Correct
(B) Maximum value of Z is at Q .
(C) Value of Z at R is less than the value at P .
(D) Value of Z at Q is less than the value at R .
Answer:(B) Maximum value of Z is at Q.
Explanation:In linear programming, the objective function ( Z = 4x + 3y ) will reach its maximum or minimum value at one of the vertices (corner points) of the feasible region.
From the graph:
- Point Q is the vertex where the feasible region is maximized in terms of ( Z ).
- The objective function increases as we move towards Q since it is the point farthest in the direction of increasing ( Z ).
Thus, the maximum value of ( Z ) occurs at point Q.
Therefore, the correct answer is (B) Maximum value of Z is at Q.
- 151 mark
Question 15
The corner points of the feasible region determined by the system of linear inequalities are , , and . If the maximum value of by, where occurs at both and , then
Solve with AIAnswer
- Correct
(A)
(B)
(C)
(D)
Ans. Option (A) is correct.
Explanation:
- 162 marks
Question 16
A small firm manufactures necklaces and bracelets. The total number of necklaces and bracelets that it can handle per day is at most 24 .
It takes one hour to make a bracelet and half an hour to make a necklace. The maximum number of hours available per day is 16.
If the profit on a necklace is and that on a bracelet is ₹ 300 . Formulate on L.P.P. for finding how many of each should
be produced daily to maximize the profit? It is being given that at least one of each must be produced.
Solve with AIWritten solution
Sol.Let necklaces and bracelets are manufactured L.P.P. is Maximize profit,
Subject to constraints
- 172 marks
Question 17
If a 20 year old girl drives her car at , she has to spend on petrol. If she drives her car at , the petrol cost increases to . She has ₹ 200 to spend on petrol and wishes to find the maximum distance she can travel within one hour. Express the above problem as a Linear Programming Problem.
Solve with AIWritten solution
Sol
Let the distance covered with speed of and the distance covered with speed of Total distance covered The L.P.P. of the above problem, therefore, is
Subject to constraints
and
- 183 marks
Question 18
Solve the following linear programming problem graphically: Minimize : subject to constraints:
Solve with AIWritten solution
Sol.


We are given the following constraints and need to find the feasible region and the value of at various corner points of the feasible region.
(2)
For the constraints:
0 60 60 0 (3)
Feasible Region:The corner points of the feasible region are given as:
Conclusion:Point Coordinates A B C D The value of is minimum at point , and the minimum value is 300.
Commonly Made Error:Some students make errors by incorrectly handling the inequality signs, leading to an incorrect feasible region.
Answering Tip:Students should ensure to sketch the correct equation with proper signs. Use either or as per the problem's requirements to avoid mistakes in determining the feasible region.
- 193 marks
Question 19
Solve the following Linear Programming Problem graphically: Minimize: , subject to the constraints: .
Solve with AIWritten solution
Sol. The feasible region determined by the constraints,
,
, is given below.
and are the corner points of the feasible region.
The values of at these corner points are given below.| Corner point | Corresponding
value of
| | | :--- | :---: | :--- | | | 100 | Minimum | | | 100 | Minimum | | | 250 | | | | 400 | |
The minimum value of is 100 at all the points on the line segment joining the points and .
- 203 marks
Question 20
Solve the following Linear Programming Problem graphically:
Maximize: ,
Subject to the constraints: , .
Solve with AIWritten solution
Sol. 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 and are given below.
| Corner point | Corresponding value of
| | :--- | :--- | | | 1 ( may or may not be the
maximum value) | | | -2 | | | -6 |
Since the feasible region is unbounded, may or may not be the maximum value. Now, we draw the graph of the inequality, , and we check whether the resulting open half-plane has any point/s, in common with the feasible region or not. Here, the resulting open half plane has points in common with the feasible region. Hence, is not the maximum value. We conclude, has no maximum value.
- 213 marks
Question 21
Each unit of Product A that a company produces, is sold for ₹100 with a production cost of ₹60 and each unit of Product B is sold for ₹150 with production cost of ₹90. On a given day, the company has a budget of ₹8000 to spend on production. The production process makes it such that they can only produce a maximum of 100 units each day. Also, the number of product B produced cannot be more than twice as many of Product A. Frame a linear programming problem to determine how many units of Product A and B should the company produce in a day in order to maximize their profit? (Note: No need to find the feasible region and optimal solution.)
Solve with AIWritten solution
Sol. Finds the profit on selling the products as: Profit for each unit of Product A sold = ₹40
Profit for each unit of Product B sold = ₹60
Takes and to be the numbers of Product A and Product B to be produced in a day respectively and frames the objective function as: Maximise
Writes the constraints of the given linear programming problem as:
- 223 marks
Question 22
Shown below is the feasible region of a maximisation problem whose objective function is given by .

(i) List all the constraints the problem is subjected to.
(ii) Find the optimal solution of the problem.
Solve with AIWritten solution
Sol. (i) Uses the graph of the feasible region and lists the constraints of the given maximisation problem as:
(ii) Finds the value of the objective function at corner points as:
Corner point 0 12 19 20 Concludes that the objective function attains maximum value at and hence is the optimal solution.
- 233 marks
Question 23
Solve the following Linear Programming Problem graphically: Minimize Subject to the constraints
Solve with AIWritten solution
Sol.

Corner points are and
Corner point 90 60 180 180 Minimum value of
Commonly Made ErrorSince there are three lines the students fail to identify the correct feasible region.
Answering TipPractice more problems on graphical solutions using a graph paper to avoid mistakes.
- 243 marks
Question 24
Solve the following Linear Programming Problem graphically: Maximize subject to
Solve with AIWritten solution
Sol. We have subject to The corner points of the feasible region are Feasible Region ABDCA

Corner Points 8000 16000 64000 62000 Maximum profit occurs at and the maximum profit
Note: the condition in the question should be read as , as used in this solution; with the corner points and would not be feasible.
- 253 marks
Question 25
A furniture trader deals in only two items - chairs and tables. He has ₹50,000 to invest and a space to store at most 35 items. A chair costs him ₹1,000 and a table costs him ₹2,000. The trader earns a profit of ₹150 and ₹250 on a chair and table, respectively. Formulate the above problem as a LPP to maximise the profit and solve it graphically.
Solve with AIWritten solution
Sol:
let the trader buy number of chairs and number of tables
We have to maximise profit He has only to invest.
Also he has a storage space of at most 35 items
Required LPP is Maximize subject to the constraints
converting into an equation
0 50 25 0 satisfy the inequality. Converting into an equation
0 35 35 0 satisfies the inequality solving both equations simultaneously we get feasible region is OBED
Corner Points For maximum profit he should buy 20 chairs and 15 tables; the maximum profit is ₹6750.

- 263 marks
Question 26
A company manufactures two types of novelty souvenirs made of plywood. Souvenirs of type requires 5 minutes each for cutting and 10 minutes each for assembling. Souvenirs of type require 8 minutes each for cutting and 8 minutes each for assembling. Given that total time for cutting is 3 hours 20 minutes and for assembling 4 hours. The profit for type souvenir is each and for type souvenir, profit is each. How many souvenirs of each type should the company manufacture in order to maximize the profit ? Formulate the problem as an LPP and solve it graphically.
Solve with AIWritten solution
Sol. Let the company manufacture ' ' number of souvenirs of Type A And, ' ' number of souvenirs of Type B LPP is: Maximise subject to
Correct Graph

For maximum profit, No. of souvenirs of Type No. of souvenirs of Type Commonly Made Error Mostly students carelessly ignore the hour to
minute conversion and go wrong.
Answering TipRead the question carefully and get used with the unit conversions.
- 273 marks
Question 27
A manufacturer has three machines I, II and III installed in his factory. Machine I and II are capable of being operated for atmost 12 hours whereas machine III must be operated for atleast 5 hours a day. He produces only two items M and N each requiring the use of all the three machines. The number of hours required for producing 1 unit of M and N on three machines are given in the following table:
| Items | Number of hours required on
machines | | | | :--- | :---: | :---: | :---: | | | I | II | III | | M | 1 | 2 | 1 | | N | 2 | 1 | 1.25 |
He makes a profit of ₹ 600 and ₹ 400 on one unit of items M and N respectively. How many units of each item should he produce so as to maximize his profit assuming that he can sell all the items that he produced. What will be the maximum profit ?
Solve with AIWritten solution
Problem StatementA manufacturer has three machines (I, II, and III) installed in his factory. Machine I and II can be operated for at most 12 hours, while machine III must be operated for at least 5 hours a day. He produces two items, M and N, each requiring the use of all three machines.
The number of hours required for producing 1 unit of M and N on the three machines are given in the following table:
Items Machine I (hrs) Machine II (hrs) Machine III (hrs) M 1 2 1 N 2 1 1.25 The manufacturer makes a profit of ₹600 for each unit of M and ₹400 for each unit of N. The goal is to determine how many units of each item should be produced to maximize the profit, assuming that all the items produced can be sold.
Step 1: Define VariablesLet:
- be the number of units of item M produced.
- be the number of units of item N produced.
The profit per unit of M is ₹600, and the profit per unit of N is ₹400. Therefore, the objective function (total profit) is:
where is the total profit.
Step 3: Constraints-
Machine I hours constraint: Machine I can be operated for a maximum of 12 hours per day. The total hours for machine I are:
-
Machine II hours constraint: Machine II can be operated for a maximum of 12 hours per day. The total hours for machine II are:
-
Machine III hours constraint: Machine III must be operated for at least 5 hours per day. The total hours for machine III are:
-
Non-negativity constraints: The number of units produced must be non-negative:
We need to maximize:
subject to the constraints:
- ,
The lines representing the constraints are:
- intersects the x-axis at and the y-axis at .
- intersects the x-axis at and the y-axis at .
- intersects the x-axis at and the y-axis at .
The feasible region is bounded, with corner points , , , and ; is where meets .
Step 5.3: Evaluate the Objective Function at Corner Points, , , , . So the optimal solution is:
- units of M
- units of N
Substitute and into the objective function:
Final Answer:The manufacturer should produce 4 units of M and 4 units of N to maximize profit, and the maximum profit is ₹4000.

- 283 marks
Question 28
Two tailors A and B earn ₹ 150 and ₹ 200 per day respectively. A can stitch 6 shirts and 4 pants per day, while can stitch 10 shirts and 4 pants per day. Form a L.P.P. to minimize the labour cost of produce (stitch) at least 60 shirts and 32 pants and solve it graphically.
Solve with AIWritten solution
Sol. Let tailor A works for days and tailor B works for days
Objective function: To minimize labour cost (in ₹) Subject to constraints
Consider equations to draw the graph and then we will shade feasible region
Corner points of feasible region are , and
Value of Z at these corner points

So minimum value of is when tailor works for 5 days and tailor works for 3 days. To check draw i.e., As there is no region common with feasible region so minimum value is ₹ 1350 . [Marking Scheme SQP, 2020-21] (Modified)
Commonly Made Error
Mostly students fail to draw the optimal line correctly.
Answering Tip
Practice more problems on LPP involving unbounded feasible region.
- 293 marks
Question 29
Solve the following linear programming problem graphically:
Maximise
Subject to the constraints:
Solve with AIWritten solution
Solution:
Corner Point Value of 0 6 Since the feasible region is unbounded, plot , which has a common region with the feasible region. Thus, has no maximum value.
- 303 marks
Question 30
Solve the following linear programming problem graphically
Maximise , subject to constraints:
Solve with AIWritten solution
Ans. Max

Corner Point Z A (0,4) 1200 B (0,6) 1800 C (4,4) 3200 D (6,0) 3000 E (5,0) 2500 Max z = 3200 at ,
- 315 marks
Question 31
Solve the following Linear Programming Problem graphically:
Maximize:
Subject to:
Solve with AIWritten solution
Sol. Maximize:
0 3 0 0 3 9 0 Feasible area is OABO
Maximise at and Maximum value

- 325 marks
Question 32
Solve the following Linear Programming Problem graphically:
Minimise: Subject to constraints:
- 335 marks
Question 33
The corner points of the feasible region determined by the system of linear constraints are as shown below:

Answer each of the following:
(i) Let be the objective function. Find the maximum and minimum value of Z and also the corresponding points at which the maximum and minimum value occurs.
(ii) Let , where be the objective function. Find the condition on and so that the maximum value of occurs at and . Also mention the number of optimal solutions in this case.
- 345 marks
Question 34
A manufacturer makes two types of toys and . Three machine are needed for this purpose and the time (in minutes) required for each toy on the machines is given below:
Types of Toys Machines I II III A 20 10 10 B 10 20 30 The machines I, II and III are available for a maximum of 3 hours, 2 hours and 2 hours 30 minutes respectively. The profit on each toy of type A is ₹50 and that of type B is ₹60. Formulate the above problem as a L.P.P. and solve it graphically to maximize profit.
- 355 marks
Question 35
A factory manufactures two types of screws and , each type requiring the use of two machines, an automatic and a hand-operated. It takes 4 minutes on the automatic and 6 minutes on the hand-operated machines to manufacture a packet of screws' ' while it takes 6 minutes on the automatic and 3 minutes on the hand-operated machine to manufacture a packet of screws ' '. Each machine is available for at most 4 hours on any day. The manufacturer can sell a packet of screws ' ' at a profit of 70 paise and screws ' ' at a profit of ₹ 1 . Assuming that he can sell all the screws he manufactures, how many packets of each type should the factory owner produce in a day in order to maximize his profit ? Formulate the above L.P.P. and solve it graphically and find the maximum profit.
- 365 marks
Question 36
This section comprises of case-study/passage-based questions. These case study questions have three sub-parts of marks 1, 1, 2 respectively. I. Read the following text and answer the following questions on the basis of the same: Seema rides her bike at . She has to spend ₹ 2 per km on diesel and if she rides it at faster speed of , the diesel cost increases to ₹5 per km. She has ₹100 to spend on diesel and wishes to maximize the distance she can travel within one hour. Let she travels with speed and with speed .

-
Write the objective function for given LPP.
-
Write the set of constraints for given LPP.
-
Draw the graph for feasible region.
Write the corner points of feasible region and find maximum value of objective function.
-
- 375 marks
Question 37
Read the following text and answer the following questions on the basis of the same: Let R be the feasible region (convex polygon) for a linear programming problem and let be the objective function. When has an optimal value (maximum or minimum), where the variables and are subject to constraints described by linear inequalities, this optimal value must occur at a corner points (vertex) of the feasible region.
- The corner points of the feasible region determined by the system of linear constraints are , . The objective function is
Compare the quantity in Column and Column .
Column Column Maximum of 325 -
What do you understand by optimal solution?
-
Solve the following LPP graphically:
Max.
subject to
OR
Draw the graph of given LPP and find the corner points of feasible region.
Minimize
Subject to constraints:
