Prashnikaप्रश्निका
Code
About
MathematicsClass 12

Linear Programming - ISC Class 12 Mathematics Questions with Answers

28 past-paper questions on Linear Programming from ISC Class 12 Mathematics papers (2027-2017), newest first, in full. Questions 1-20 are on this page, 20 to a page. Tap "Show answer" under a question to see its answer. The syllabus covers Introduction and related terminology, Mathematical formulation of L.P. problems, Graphical method of solution, Feasible and infeasible regions, Feasible and infeasible solutions and Optimal feasible solutions.

28questions
11years
2027newest
20275 questions
1 mark · Short answerOpen: Formulate the constraints which represent the above feasible region.

Solve the following linear programming problem.

Formulate the constraints which represent the above feasible region.
LPP Feasible Region
LPP Feasible Region
Show answer

Answer

Official answer key
The feasible region is bounded by the line $2x + y = 9$ (through $(0,9)$ and $(\frac{9}{2}, 0)$), the line $y = x$ and the line $x = 1$. Constraints: $2x + y \le 9$, $y \ge x$, $x \ge 1$.
1 mark · MCQOpen: An objective function Z = ax + by is maximum at points (8,10) and (7,12). If a…

Choose the correct option.

An objective function $Z = ax + by$ is maximum at points $(8,10)$ and $(7,12)$. If $a, b \ge 0$ and $ab = 72$, then the maximum value of the function is equal to:
  • a84
  • b132
  • c156
  • d176
Show answer

Answer

Official answer key

Correct option: c

Answer: (c) 156 Equal maxima at $(8,10)$ and $(7,12)$: $8a + 10b = 7a + 12b$, so $a = 2b$. With $ab = 72$: $b = 6$, $a = 12$. Maximum value $= 8(12) + 10(6) = 156$.
1 mark · MCQOpen: Statement I: Every Linear Programming Problem has at least one optimal…

Choose the correct option.

Statement I: Every Linear Programming Problem has at least one optimal solution. Statement II: If a Linear Programming Problem has two optimal solutions, then it has infinitely many solutions. Which of the statements is correct?
  • aStatement I is true and Statement II is false.
  • bStatement I is false and Statement II is true.
  • cBoth the statements are true.
  • dBoth the statements are false.
Show answer

Answer

Official answer key

Correct option: b

Answer: (b) Statement I is false and Statement II is true. Statement I is false: some LPPs are infeasible (or unbounded) and have no optimal solution. Statement II is true: if two points give the same optimal value, every point on the line segment joining them does too, so there are infinitely many optimal solutions.
1 mark · Short answerOpen: Hence, maximise the objective function given by Z = x + y.

Solve the following linear programming problem.

Hence, maximise the objective function given by $Z = x + y$.
LPP Feasible Region
LPP Feasible Region
Show answer

Answer

Official answer key
Corner points: $A(1,1)$, $B(3,3)$, $C(1,7)$. $Z = x + y$: at $A$, $Z = 2$; at $B$, $Z = 6$; at $C$, $Z = 8$. Maximum $Z = 8$ at $C(1,7)$.
1 mark · Short answerOpen: What change in the constraints will make the feasible region unbounded?

Solve the following linear programming problem.

What change in the constraints will make the feasible region unbounded?
LPP Feasible Region
LPP Feasible Region
Show answer

Answer

Official answer key
Change the constraint $2x + y \le 9$ to $2x + y \ge 9$. The region is then no longer closed by the line $2x + y = 9$ and becomes unbounded.
20265 questions
4 marks · Linear programmingOpen: The feasible region for an L.P.P. is shown in the adjoining figure: Based on…

Solve the following linear programming problem.

The feasible region for an L.P.P. is shown in the adjoining figure: Based on the given graph, answer the following questions. (Analysis)
Figure for this question
(a)[1]
Write the constraints for the L.P.P.
(b)[1.5]
Find the co-ordinates of the point B.
(c)[1.5]
Find the maximum value of the objective function $Z = x + y$.
Show answer

Answer (a)

Official answer key
Line $AD$ through $A(25,0)$ and $D(0,50)$: $\frac{x}{25} + \frac{y}{50} = 1 \Rightarrow 2x + y = 50$. Line $EC$ through $E(40,0)$ and $C(0,20)$: $\frac{x}{40} + \frac{y}{20} = 1 \Rightarrow x + 2y = 40$. The origin lies in the feasible region, so the constraints are $2x + y \le 50$, $x + 2y \le 40$, $x \ge 0$, $y \ge 0$.

Answer (b)

Official answer key
$B$ is the intersection of $2x + y = 50$ and $x + 2y = 40$. Solving: $x = 20$, $y = 10$.

Final answer: (20, 10)

Answer (c)

Official answer key
Corner points: $O(0,0)$, $C(0,20)$, $B(20,10)$, $A(25,0)$. $Z = x + y$: at $O$, $Z = 0$; at $C$, $Z = 20$; at $B$, $Z = 30$; at $A$, $Z = 25$. The maximum value of $Z$ is $30$, at $B(20,10)$.

Final answer: 30

4 marks · Linear programmingOpen: Raunak is a small-scale entrepreneur who sells sewing machines in a rural…

Solve the following linear programming problem.

Raunak is a small-scale entrepreneur who sells sewing machines in a rural market. He wants to expand his business but has two main constraints: Capital and Storage. He has a total capital of ₹5,760 to invest. The godown can store a maximum number of 20 sewing machines. Raunak sells two types of machines: - Electronic sewing machine, each costs him ₹360. - Manually operated sewing machine, each costs him ₹240. His wife Radhika suggests selling an electronic machine at a profit of ₹22 and a manually operated sewing machine at a profit of ₹18. Using the concept of Linear Programming Problem, find the number of sewing machines of each type that Raunak should sell to maximise his profit.
Show answer

Answer

Objective: Maximise Z = 22x + 18y

Constraints: 3x + 2y <= 48; x + y <= 20; x, y >= 0

Corner point (x, y)Z
(0, 0)0
(0, 20)360
(8, 12)392 (optimal)
(16, 0)352

Maximum: Z = 392 at (8, 12)

Let $x$ = number of electronic machines and $y$ = number of manual machines. Capital: $360x + 240y \le 5760 \Rightarrow 3x + 2y \le 48$. Storage: $x + y \le 20$. Also $x, y \ge 0$. Maximise $Z = 22x + 18y$. Corner points of the feasible region: $O(0,0)$, $A(16,0)$, $B(8,12)$ (intersection of $3x+2y=48$ and $x+y=20$), $C(0,20)$. $Z(O) = 0$, $Z(A) = 352$, $Z(B) = 176 + 216 = 392$, $Z(C) = 360$. Maximum profit is ₹392, reached at $x = 8$, $y = 12$. Hence Raunak should sell 8 electronic and 12 manually operated sewing machines.
4 marks · Linear programmingOpen: An ice-cream factory makes ice creams of two flavours: chocolate and mango. -…

Solve the following linear programming problem.

An ice-cream factory makes ice creams of two flavours: chocolate and mango. - Each chocolate ice cream needs 5 minutes of mixing and 10 minutes of freezing. - Each mango ice cream needs 8 minutes of mixing and 8 minutes of freezing. - There are 3 hours 20 minutes available for mixing and 240 minutes available for freezing. - The profit from the sale of each chocolate ice cream is ₹50 and from each mango ice cream is ₹60. Using Linear Programming Problem, find the number of chocolate and mango ice creams that the ice cream factory should make to maximise profit.
Show answer

Answer

Objective: Maximise Z = 50x + 60y

Constraints: 5x + 8y <= 200; 10x + 8y <= 240; x, y >= 0

Corner point (x, y)Z
(0, 0)0
(0, 25)1500
(8, 20)1600 (optimal)
(24, 0)1200

Maximum: Z = 1600 at (8, 20)

Let $x$ chocolate and $y$ mango ice creams be made. Mixing time: $5x+8y\le 200$ (3 h 20 min = 200 min). Freezing time: $10x+8y\le 240$. Also $x,y\ge0$. Maximise $Z=50x+60y$. Corner points of the feasible region: $O(0,0)$, $(24,0)$, $(8,20)$ (where the two lines meet) and $(0,25)$. Z at $(0,0)=0$; at $(24,0)=1200$; at $(8,20)=400+1200=1600$; at $(0,25)=1500$. Maximum profit is $\text{₹}1600$ when 8 chocolate and 20 mango ice creams are made.
4 marks · Linear programmingOpen: The feasible region for a Linear Programming Problem is shown in the following…

Solve the following linear programming problem.

The feasible region for a Linear Programming Problem is shown in the following graph. Based on the given graph, answer the following questions:
Figure for this question
(a)[2]
Write the constraints for the Linear Programming Problem.
(b)[1]
Find the coordinates for point B.
(c)[1]
Find the least value of the objective function: $Z = x + y$
Show answer

Answer (a)

Line through $B_1(0,8)$ and $A_1(4,0)$: $2x+y=8$. Line through $B_2(0,5)$ and $A_2(10,0)$: $x+2y=10$. The shaded region lies on the far side of both lines from the origin, in the first quadrant. Constraints: $2x+y\ge 8$, $x+2y\ge 10$, $x\ge0$, $y\ge0$.

Answer (b)

Solution: $x = 2$, $y = 4$

B is the intersection of $2x+y=8$ and $x+2y=10$. Multiply the first by $2$: $4x+2y=16$; subtract the second: $3x=6$, so $x=2$ and $y=4$.

Final answer: $(2, 4)$

Answer (c)

Corner points: $(0,8)$, $(2,4)$, $(10,0)$. $Z=x+y$: $8$, $6$, $10$ respectively. The region is unbounded but $Z$ cannot go below the corner values, so the least value is $6$ at $B(2,4)$.

Final answer: $6$

4 marks · Linear programmingOpen: A linear programming problem is given by Z = px + qy where p, q > 0 subject to…

Solve the following linear programming problem.

A linear programming problem is given by $Z = px + qy$ where $p, q > 0$ subject to the constraints: $x + y \le 60$, $5x + y \le 100$, $x \ge 0$ and $y \ge 0$ (Analysis)
(a)[2]
Solve graphically to find the corner points of the feasible region.
(b)[2]
If $Z = px + qy$ is maximum at $(0,60)$ and $(10, 50)$, find the relation of $p$ and $q$. Also mention the number of optimal solution(s) in this case.
Show answer

Answer (a)

Official answer key
Draw $x + y = 60$ (through $(0,60)$ and $(60,0)$) and $5x + y = 100$ (through $(0,100)$ and $(20,0)$); the feasible region is bounded by the axes and these lines. They meet where $4x = 40$, i.e. $(10, 50)$. Corner points: $(0,0)$, $(20,0)$, $(10,50)$, $(0,60)$.

Final answer: (0, 0), (20, 0), (10, 50), (0, 60)

Answer (b)

Official answer key
$Z$ at $(0,60)$ is $60q$ and at $(10,50)$ is $10p + 50q$. Equal maximum values: $60q = 10p + 50q \Rightarrow 10q = 10p \Rightarrow p = q$. When $Z$ has the same maximum value at two corner points, every point on the segment joining them is also optimal, so there are infinitely many optimal solutions.
20256 questions
4 marks · Linear programmingOpen: A linear programming problem is given by Z = px + qy where p, q > 0 subject to…

Solve the following linear programming problem.

A linear programming problem is given by $Z = px + qy$ where $p, q > 0$ subject to the constraints: $x + y \le 60, 5x + y \le 100, x \ge 0 \text{ and } y \ge 0$
(i)[2]
Solve graphically to find the corner points of the feasible region.
(ii)[2]
If $Z = px + qy$ is maximum at $(0, 60)$ and $(10, 50)$, find the relation of $p$ and $q$. Also mention the number of optimal solution(s) in this case.
Show answer

Answer (i)

Official answer key
From graph, corner points are: A $(0, 60)$, B $(10, 50)$, C $(20, 0)$, D $(0, 0)$

Answer (ii)

Official answer key
$Z = px + qy$ Given, Z is maximum at $(0, 60)$ and $(10, 50)$ $\therefore 0 \cdot p + 60 \cdot q = 10 \cdot p + 50 \cdot q$ $\Rightarrow 10p = 10q$ $\Rightarrow p = q$ So there can be infinite number of optimal solutions.
4 marks · NumericalOpen: The corner points of the feasible region determined by the system of linear…

Solve the following.

The corner points of the feasible region determined by the system of linear constraints are as shown below: Answer the following questions.
Figure for this question
(a)[1]
Let $Z = 3x - 4y$ 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.
(b)[1.5]
Let $Z = px + qy$ where $p, q > 0$ be the objective function. Find the condition on $p$ and $q$ so that the maximum value of $Z$ occurs at $B(4,10)$ and $C(6,8)$.
(c)[1.5]
State the number of optimal solutions in this case.
Show answer

Answer (a)

Official answer key
$Z$ is minimum at $A(0, 8)$ and $Z_{\min} = -32$, $Z$ is maximum at $E(4, 0)$ and $Z_{\max} = 12$.

Final answer: $Z_{\min} = -32$ at $A(0,8)$; $Z_{\max} = 12$ at $E(4,0)$

Answer (b)

Official answer key
At $B(4, 10)$, $Z = 4p + 10q$ At $C(6, 8)$, $Z = 6p + 8q$ As $Z$ is maximum for both cases, $4p + 10q = 6p + 8q \Rightarrow p = q$ is the required condition.

Final answer: $p = q$

Answer (c)

Official answer key
Infinite solutions.
4 marks · Linear programmingOpen: A linear programming problem (LPP) is given as: Maximize Z = x + 2y subject to…

Solve the following linear programming problem.

A linear programming problem (LPP) is given as: Maximize $Z = x + 2y$ subject to the constraints $x - y \ge 0, 2 \ge 2y - x, x \ge 0, y \ge 0$ Based on the above information, answer the following questions.
(a)[1]
Find the corner points of the feasible region.
(b)[1.5]
Find the corner point where maximum occurs.
(c)[1.5]
Optimum solution does not exist. Justify your answer.
Show answer

Answer (a)

Official answer key
$(0,0), (2,2)$.

Final answer: $(0,0), (2,2)$

Answer (b)

Official answer key
$(2,2)$

Final answer: $(2,2)$

Answer (c)

Official answer key
At $(2,2)$, $z = x + 2y = 6$. As the feasible region is unbounded, hence, largest value $6$ may or may not be maximum. After plotting half plane $x + 2y > 6$, we found that there are common points with feasible region. Hence, optimum solution does not exist.
4 marks · Linear programmingOpen: A cooperative society of farmers has 50 hectares of land to grow two crops, X…

Solve the following linear programming problem.

A cooperative society of farmers has 50 hectares of land to grow two crops, X and Y. The profits from crops, X and Y per hectare are estimated as ₹ 10500 and ₹ 9000 respectively. To control weeds, a liquid herbicide has to be used on crops X and Y in the quantity of 20 litres and 10 litres per hectare respectively. Further, the quantity of herbicide to be used on both the crops should not exceed 800 litres to protect the environment. How much land should be allocated to each crop to maximise the total profit of the society? Formulate the above Linear Programming Problem mathematically and then solve it graphically.
Show answer

Answer

Objective: Maximise Z = 10500x + 9000y

Constraints: x + y <= 50; 2x + y <= 80; x, y >= 0

Corner point (x, y)Z
(0, 0)0
(0, 50)450000
(30, 20)495000 (optimal)
(40, 0)420000

Maximum: Z = 495000 at (30, 20)

Let $x$ hectares be allotted to crop X and $y$ hectares to crop Y. Maximise $Z=10500x+9000y$ subject to $x+y\le50$ (land), $20x+10y\le800$ i.e. $2x+y\le80$ (herbicide), $x,y\ge0$. Corner points of the feasible region: $O(0,0)$, $A(40,0)$, $B(30,20)$ (from $x+y=50$ and $2x+y=80$), $C(0,50)$. $Z(O)=0$, $Z(A)=4,20,000$, $Z(B)=3,15,000+1,80,000=4,95,000$, $Z(C)=4,50,000$. Hence $Z$ is maximum at $B(30,20)$: 30 hectares for crop X and 20 hectares for crop Y, giving a maximum profit of ₹ 4,95,000.
4 marks · Linear programmingOpen: Two different types of books have to be stacked in the shelf of a library. The…

Solve the following linear programming problem.

Two different types of books have to be stacked in the shelf of a library. The first type of book weighs 1 kg and has a thickness of 6 cm. The second type of book weighs 1.5 kg and has a thickness of 4 cm. The shelf is 96 cm long and can support a maximum weight of 21 kg. How should both the types of books be placed in the shelf to include the maximum number of books? Formulate a Linear Programming Problem and solve it graphically.
Show answer

Answer

Objective: Maximise Z = x + y

Constraints: 2x + 3y <= 42; 3x + 2y <= 48; x, y >= 0

Corner point (x, y)Z
(0, 0)0
(0, 14)14
(12, 6)18 (optimal)
(16, 0)16

Maximum: Z = 18 at (12, 6)

Let $x$ books of the first type and $y$ of the second be placed. Maximise $Z=x+y$ Subject to: $x+1.5y\le21$, i.e. $2x+3y\le42$ (weight); $6x+4y\le96$, i.e. $3x+2y\le48$ (length); $x,y\ge0$. Corner points: $(0,0):Z=0$; $(16,0):Z=16$; $(12,6):Z=18$; $(0,14):Z=14$. Maximum $Z=18$ at $(12,6)$. Hence 12 books of the first type and 6 of the second type should be placed (18 books in all).
4 marks · Linear programmingOpen: A manufacturing company produces two types of cell phones, Android and iOS. The…

Solve the following linear programming problem.

A manufacturing company produces two types of cell phones, Android and iOS. The company has resources to make at the most 300 sets a week. It takes ₹ 1800 to make an Android set and ₹ 2700 to make an iOS set. The company cannot spend more than ₹ 648000 a week to make cell phones. The company makes a profit of ₹ 510 per Android and ₹ 675 per iOS set. If $x$ and $y$ denote, respectively, the number of Android sets and iOS sets made each week, then formulate this problem as a Linear Programming Problem (LPP) given that the objective is to maximize the profit. Based on it, answer the questions that follow.
(a)[1]
What will be the maximum profit function on $x$ and $y$ sets? (write your objective based on the above data).
(b)[1]
What will be the values of your objective function in the feasible region? (at corner points)
(c)[1]
At what point the maximum profit will occur?
(d)[1]
What’s the weekly cost (in ₹) of manufacturing the sets?
Show answer

Answer (a)

Official answer key
Let $x$ and $y$ denote, respectively, the number of Android and iOS cell phones. Thus, $x \geq 0$, $y \geq 0$. Since, the company can make at most 300 sets a week, therefore, $x + y \leq 300$. Weekly cost (in ₹) of manufacturing the set is $1800x + 2700y$ and the company can spend up to ₹ 648000. Therefore, $1800x + 2700y \leq 648000$, i.e., $2x + 3y \leq 720$. Objective function is Maximize $Z = 510x + 675y$.

Final answer: Maximize $Z = 510x + 675y$

Answer (b)

Official answer key
Values of objective function $Z = 510x + 675y$ at corner points: C(0, 240): 162000; B(180, 120): 172800; A(300, 0): 153000; O(0, 0): 0.

Final answer: C(0,240): 162000; B(180,120): 172800; A(300,0): 153000; O(0,0): 0

Answer (c)

Official answer key
Maximum $Z$ is 172800 at the point B(180, 120).

Answer (d)

Official answer key
Weekly cost $= 1800 \times 180 + 2700 \times 120 = 648000$.
20241 question
4 marks · Linear programmingOpen: Aman has ₹ 1500 to purchase rice and wheat for his grocery shop. Each sack of…

Solve the following linear programming problem.

Aman has ₹ 1500 to purchase rice and wheat for his grocery shop. Each sack of rice and wheat costs ₹ 180 and ₹ 120 respectively. He can store a maximum number of 10 bags in his shop. He will earn a profit of ₹ 11 per bag of rice and ₹ 9 per bag of wheat.
(i)[2]
Formulate a Linear Programming Problem to maximise Aman’s profit.
(ii)[2]
Calculate the maximum profit.
Show answer

Answer (i)

Let Aman buy $x$ sacks of rice and $y$ sacks of wheat. Maximise $Z = 11x + 9y$ Subject to: $180x + 120y \le 1500$, i.e. $3x + 2y \le 25$ (money) $x + y \le 10$ (storage) $x \ge 0,\ y \ge 0$

Answer (ii)

Corner points of the feasible region: $O(0,0)$, $A\left(\frac{25}{3}, 0\right)$, $B(5,5)$ (intersection of $3x + 2y = 25$ and $x + y = 10$), $C(0,10)$. Z at $(0,0) = 0$; at $\left(\frac{25}{3}, 0\right) = \frac{275}{3} \approx 91.67$; at $(5,5) = 55 + 45 = 100$; at $(0,10) = 90$. Maximum $Z = 100$ at $(5, 5)$. Hence Aman's maximum profit is ₹ 100, by buying 5 sacks of rice and 5 sacks of wheat.

Final answer: 100 ₹

20233 questions
4 marks · Linear programmingOpen: Solve the following linear programming problem graphically and interpret your…

Solve the following linear programming problem.

Solve the following linear programming problem graphically and interpret your result of $Z = 2x - 5y$ subject to the constraints $x + y \ge 2$, $x - y \ge 0$, $x \le 1$, $x \ge 0$, $y \ge 0$.
Show answer

Answer

Objective: Minimise Z = 2x - 5y

Corner point (x, y)Z
(1, 1)-3 (optimal)

Minimum: Z = -3 at (1, 1)

Maximise or minimise $Z = 2x - 5y$ subject to $x + y \ge 2$, $x - y \ge 0$, $x \le 1$, $x, y \ge 0$. From $x - y \ge 0$ and $x \le 1$: $y \le x \le 1$, so $x + y \le 2$. With $x + y \ge 2$ this forces $x + y = 2$, $x = 1$ and $y = 1$. On the graph the regions of the constraints meet at the single point $(1, 1)$, so the feasible region is this one point. At $(1, 1)$: $Z = 2(1) - 5(1) = -3$. Hence $Z$ has the value $-3$ at $(1, 1)$; as it is the only feasible point, this is both the maximum and the minimum.
4 marks · Linear programmingOpen: The standard weight of a special purpose brick is 5 kg and it must contain two…

Solve the following linear programming problem.

The standard weight of a special purpose brick is $5\text{ kg}$ and it must contain two basic ingredients $B_1$ and $B_2$. $B_1$ costs ₹ $5$ per kg and $B_2$ costs ₹ $8$ per kg. Strength considerations dictate that the brick should not contain more than $4\text{ kg}$ of $B_1$ and minimum $2\text{ kg}$ of $B_2$. Since the demand for the product is likely to be related to the price of the bricks, find the minimum cost of the brick satisfying the above conditions. Formulate this situation as an L.P.P. and solve it graphically.
Show answer

Answer

Objective: Minimise Z = 5x + 8y

Constraints: x + y = 5; x <= 4; y >= 2; x, y >= 0

Corner point (x, y)Z
(0, 5)40
(3, 2)31 (optimal)

Minimum: Z = 31 at (3, 2)

Let the brick contain $x$ kg of $B_1$ and $y$ kg of $B_2$. Minimise the cost $Z = 5x + 8y$ subject to $x + y = 5$, $x \le 4$, $y \ge 2$, $x, y \ge 0$. From $y = 5 - x \ge 2$ we get $x \le 3$, so the feasible region is the line segment of $x + y = 5$ from $(0, 5)$ to $(3, 2)$. Corner points: at $(0, 5)$, $Z = 40$; at $(3, 2)$, $Z = 15 + 16 = 31$. Hence the minimum cost is ₹ $31$ per brick, with $3$ kg of $B_1$ and $2$ kg of $B_2$.
4 marks · Linear programmingOpen: Solve the following Linear Programming Problem graphically: Maximise Z = 5x +…

Solve the following linear programming problem.

Solve the following Linear Programming Problem graphically: Maximise $Z = 5x + 2y$ subject to: $x - 2y \le 2$ $3x + 2y \le 12$ $-3x + 2y \le 3$ $x \ge 0, y \ge 0$
Show answer

Answer

Corner point (x, y)Z
(0, 0)0
(0, 3/2)3
(3/2, 15/4)15
(2, 0)10
(7/2, 3/4)19 (optimal)

Maximum: Z = 19 at (7/2, 3/4)

Maximise $Z = 5x + 2y$ subject to $x - 2y \le 2$, $3x + 2y \le 12$, $-3x + 2y \le 3$, $x, y \ge 0$. The feasible region is bounded, with corner points $O(0,0)$, $A(2,0)$, $B\left(\frac{7}{2},\frac{3}{4}\right)$, $C\left(\frac{3}{2},\frac{15}{4}\right)$, $D\left(0,\frac{3}{2}\right)$. At $O$: $Z = 0$; at $A$: $Z = 10$; at $B$: $Z = \frac{35}{2} + \frac{3}{2} = 19$; at $C$: $Z = \frac{15}{2} + \frac{15}{2} = 15$; at $D$: $Z = 3$. Hence $Z$ is maximum, equal to $19$, at $x = \frac{7}{2}$, $y = \frac{3}{4}$.

About Linear Programming

Linear Programming is a unit of the ISC Class 12 Mathematics syllabus. The syllabus gives 5 of the 80 theory marks to Linear Programming.

The syllabus lists these topics: Introduction and related terminology, Mathematical formulation of L.P. problems, Graphical method of solution, Feasible and infeasible regions, Feasible and infeasible solutions and Optimal feasible solutions.

Prashnika has 28 past-paper questions on Linear Programming, from papers of 2017-2027, asked in 11 different years. By kind: Linear programming (22), Short answer (3), MCQ (2) and Numerical (1). They carry between 1 and 6 marks, and most are worth 4 marks.

To practise, use the LPP solver (graphical method) and the paper generator, which can build a practice paper from this chapter.

Common questions

What topics are in Linear Programming in ISC Class 12 Mathematics?

The syllabus lists Introduction and related terminology, Mathematical formulation of L.P. problems, Graphical method of solution, Feasible and infeasible regions, Feasible and infeasible solutions and Optimal feasible solutions.

How many questions on Linear Programming are in ISC Class 12 Mathematics past papers?

Prashnika has 28 questions on Linear Programming, from papers of 2017-2027 (board, specimen, improvement and practice papers together).

What kinds of questions are asked on Linear Programming?

By kind: Linear programming (22), Short answer (3), MCQ (2) and Numerical (1).

Questions on other pages on Linear Programming