Linear ProgrammingClass 12 Mathematics Previous Year Questions

48 Questions
Full year papers

MCQs

3 questions
CBSE 2026 · Set 65/4/11 markMCQ
The region represented by the system of inequations 3x+y≥33 \mathrm{x}+\mathrm{y} \geq 3, 2x−y≥−52 \mathrm{x}-\mathrm{y} \geq-5, x,y≥0\mathrm{x}, \mathrm{y} \geq 0 is : (A) unbounded in 1st 1^{\text {st }} quadrant (B) bounded in 1st 1^{\text {st }} quadrant (C) unbounded in 2nd 2^{\text {nd }} quadrant (D) bounded in 2nd 2^{\text {nd }} quadrant
CBSE 2026 · Set 65/4/11 markMCQ
In the graph, the feasible region representing the Linear Programming Problem for maximising objective function Z=px+qy,p,q>0\mathrm{Z}=\mathrm{px}+\mathrm{qy}, \mathrm{p}, \mathrm{q}>0 is shaded. If all points on segment AB give max (Z), then which of the following is true? (A) p=2q\mathrm{p}=2 \mathrm{q} (B) p=3q\mathrm{p}=3 \mathrm{q} (C) q=3p\mathrm{q}=3 \mathrm{p} (D) q=2p\mathrm{q}=2 \mathrm{p}
CBSE 2026 · Set 65/5/11 markMCQ
The corner points of the feasible region determined by the system of linear constraints are (0, 0), (0, 40), (20, 40) (60, 20) and (60, 0). If the objective function of an LPP is Z=4x+3y\mathrm{Z}=4 \mathrm{x}+3 \mathrm{y}, then the maximum value is : (A) 200 (B) 300 (C) 240 (D) 120