Solve the following linear programming problem.

Show answer
Answer
Official answer key28 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.
Nothing matches. Try fewer letters.
Solve the following linear programming problem.

Answer
Official answer keyChoose the correct option.
Answer
Official answer keyCorrect option: c
Choose the correct option.
Answer
Official answer keyCorrect option: b
Solve the following linear programming problem.

Answer
Official answer keySolve the following linear programming problem.

Answer
Official answer keySolve the following linear programming problem.

Answer (a)
Official answer keyAnswer (b)
Official answer keyFinal answer: (20, 10)
Answer (c)
Official answer keyFinal answer: 30
Solve the following linear programming problem.
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)
Solve the following linear programming problem.
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)
Solve the following linear programming problem.

Answer (a)
Answer (b)
Solution: $x = 2$, $y = 4$
Final answer: $(2, 4)$
Answer (c)
Final answer: $6$
Solve the following linear programming problem.
Answer (a)
Official answer keyFinal answer: (0, 0), (20, 0), (10, 50), (0, 60)
Answer (b)
Official answer keySolve the following linear programming problem.
Answer (i)
Official answer keyAnswer (ii)
Official answer keySolve the following.

Answer (a)
Official answer keyFinal answer: $Z_{\min} = -32$ at $A(0,8)$; $Z_{\max} = 12$ at $E(4,0)$
Answer (b)
Official answer keyFinal answer: $p = q$
Answer (c)
Official answer keySolve the following linear programming problem.
Answer (a)
Official answer keyFinal answer: $(0,0), (2,2)$
Answer (b)
Official answer keyFinal answer: $(2,2)$
Answer (c)
Official answer keySolve the following linear programming problem.
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)
Solve the following linear programming problem.
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)
Solve the following linear programming problem.
Answer (a)
Official answer keyFinal answer: Maximize $Z = 510x + 675y$
Answer (b)
Official answer keyFinal answer: C(0,240): 162000; B(180,120): 172800; A(300,0): 153000; O(0,0): 0
Answer (c)
Official answer keyAnswer (d)
Official answer keySolve the following linear programming problem.
Answer (i)
Answer (ii)
Final answer: 100 ₹
Solve the following linear programming problem.
Answer
Objective: Minimise Z = 2x - 5y
| Corner point (x, y) | Z |
| (1, 1) | -3 (optimal) |
Minimum: Z = -3 at (1, 1)
Solve the following linear programming problem.
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)
Solve the following linear programming problem.
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)
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.
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.
Prashnika has 28 questions on Linear Programming, from papers of 2017-2027 (board, specimen, improvement and practice papers together).
By kind: Linear programming (22), Short answer (3), MCQ (2) and Numerical (1).