Skip to content
MathsCBSE Class 12 · Sample paper, session 2026-27 · 3 marks · Short answer

CBSE Class 12 Mathematics sample paper 2026-27: question 31

From the official CBSE sample question paper for 2026-27, section C, question 31, for 3 marks. Try it first; the hints and our step-by-step solution are below.

Q31 · 3 marks · Short answerLinear Programming

Solve the linear programming problem graphically:
Maximize
Subject to constraints: , ,

Source: official sample paper from cbseacademic.nic.in (PDF). See it in the full Sample paper 2026-27.

Hints

Open one hint at a time and try again before the next.

Hint 1

Draw the three boundary lines and find where each pair meets.

Hint 2

The feasible region is a triangle; evaluate at each of its vertices.

Step-by-step solution

Each step shows the marks it earns, as an examiner would award them. Checked by an independent re-solve from the question paper.

  1. Graph: draw the lines (through and ), (through the origin and ) and . The feasible region is on the origin side of , below or to the right of , and above . It is the bounded triangle with vertices [from , ], [from , ] and [from , ].

    1½ marks
  2. Corner point values: ; ;

    1 mark
  3. Maximum at , i.e. .

    ½ mark

Answer: Maximum at

Where the marks are

  • Draws the graph and shades the correct bounded feasible region with vertices (1½ marks)
  • Evaluates at every corner point (1 mark)
  • States the maximum value 220 at (½ mark)

Revise the chapter

  • Chapter: Linear Programming (notes, formulas, where marks are lost and every past question)

The question is transcribed from the official paper; figures are described in words. The solution, hints and chapter tag are ours. Spotted an error? Write tosupport@questionbuddy.in.