Class 12 (CBSE) · Mathematics
Linear Programming
25 practice questions with full step-by-step solutions, quick revision notes — free, no sign-up.
Reviewed by Kaustav Basak (19 years teaching)Written with AI helpReport a mistake
This chapter has
Linear Programming — quick revision notes
- Objective function: the linear function Z = ax + by to be maximised or minimised; x and y are the decision variables.
- Constraints are linear inequalities; the non-negativity constraints are x >= 0, y >= 0.
- Feasible region: the common region of all constraints including non-negativity; points outside it are infeasible.
- Corner point: a vertex of the feasible region, i.e. the intersection of two boundary lines.
- Corner Point Theorem: if an optimal value exists, it occurs at a corner point of the feasible region.
- If the feasible region is bounded, Z has both a maximum and a minimum value, each at a corner point.
- If the region is unbounded and M is the largest corner value of Z, then M is the maximum only if the open half-plane ax + by > M has no point in common with the feasible region (for minimum m, check ax + by < m).
- If two corner points give the same optimal value, every point on the segment joining them is also optimal (infinitely many optimal solutions).
- To decide the side of a line, test a point such as the origin in the inequality.
Common mistakes to avoid
- Evaluating Z at an intersection point of two lines that does not actually lie in the feasible region.
- Taking the corner-point maximum of an unbounded region as the answer without checking the open half-plane condition.
- Assuming the optimum is always at the intersection of the two main constraint lines; always compare all corner points.
- Shading the wrong side of a line by not testing a point such as (0, 0).
Linear Programming — solved practice questions
6 Class 12 Mathematics questions with step-by-step solutions. Attempt each, then reveal the answer.
These worked examples are not in the timed test, so you can study them first.
- Q1easyReport
In a linear programming problem, the linear function Z = ax + by that has to be maximised or minimised is called the:
- Afeasible region
- Bconstraint
- Cdecision variable
- Dobjective function
Show answer & solution
Correct answer: (D) objective function
The linear function whose optimal (maximum or minimum) value is sought is the objective function. Constraints are the restricting inequalities, and x, y are the decision variables. - Q2easyReport
The non-negativity constraints in an LPP with decision variables x and y are:
- Ax <= 0, y <= 0
- Bx > 0, y > 0
- Cx + y >= 0
- Dx >= 0, y >= 0
Show answer & solution
Correct answer: (D) x >= 0, y >= 0
Quantities such as items produced or food units cannot be negative, but they can be zero, so we write x >= 0 and y >= 0. Strict inequalities would wrongly exclude zero. - Q3easyReport
If the feasible region of an LPP is bounded, then the objective function Z = ax + by:
- Ahas both a maximum and a minimum value, each occurring at a corner point
- Bhas only a minimum value
- Chas only a maximum value
- Dmay have neither a maximum nor a minimum value
Show answer & solution
Correct answer: (A) has both a maximum and a minimum value, each occurring at a corner point
By the Corner Point Theorem, on a bounded feasible region Z attains both its maximum and minimum values, and each of these occurs at a corner point of the region. - Q4mediumReport
The corner points of a bounded feasible region are (0, 0), (5, 0), (3, 4) and (0, 5). The maximum value of Z = 3x + 2y is:
- A17
- B15
- C20
- D10
Show answer & solution
Correct answer: (A) 17
Z(0, 0) = 0, Z(5, 0) = 15, Z(3, 4) = 9 + 8 = 17, Z(0, 5) = 10. The largest value is 17, at (3, 4). - Q5mediumReport
The corner points of a bounded feasible region are (0, 4), (2, 0), (6, 0), (6, 5) and (0, 8). The minimum value of Z = 2x + 3y and the point where it occurs are:
- A4, at (2, 0)
- B24, at (0, 8)
- C12, at (0, 4)
- D0, at (0, 0)
Show answer & solution
Correct answer: (A) 4, at (2, 0)
Z(0, 4) = 12, Z(2, 0) = 4, Z(6, 0) = 12, Z(6, 5) = 27, Z(0, 8) = 24. The least value is 4 at (2, 0). The origin is not a corner point here, so 0 is not attainable. - Q6easyReport
The feasible region of an LPP is the set of all points that satisfy:
- Aall the constraints, including the non-negativity constraints
- Bonly the non-negativity constraints
- Cthe equation Z = 0
- Dat least one of the constraints
Show answer & solution
Correct answer: (A) all the constraints, including the non-negativity constraints
The feasible region is the common region determined by all the constraints together, including x >= 0 and y >= 0. Every point of it is a feasible solution.
Ready to test yourself? Take the 19-question Linear Programming test →