Standard form of an LPP
Linear Programming · Terminology and Formulation\[\text{Optimise } Z=px+qy\ \text{ subject to }\ a_ix+b_iy\ (\le,\ \ge)\ c_i,\quad x\ge0,\ y\ge0\]
Chapter 12 · Linear Programming
Businesses, farms and kitchens constantly ask “how much of each should we make or buy to get the best result under our limits?” Linear programming answers such questions when the goal and the limits are linear. In this chapter you will learn the vocabulary, translate word problems into mathematical form, and solve two-variable problems by the graphical (corner-point) method.
Linear programming is about making the best decision when resources are limited. You will learn the terms used (decision variables, objective function, constraints, feasible region, optimal solution), turn a word problem into a linear programming problem, and solve it graphically by evaluating the objective function at the corner points of the feasible region.
None of the rationalised topics is in this chapter, so formulation and the graphical method are both fully in scope. The problems are limited to two variables, which is why a graph is enough.
The chapter forms its own unit, Linear Programming, worth 5 marks. A full problem with formulation, graph and corner-point table fits naturally as a long answer or a case-based question, while MCQs and Assertion-Reason items can test corner points, feasible regions and the conditions for an optimal value. The question pattern described here is the one this site follows; always confirm it in the latest official sample paper at cbseacademic.nic.in.
Key tip: For an unbounded feasible region, the corner-point value is only a candidate. To confirm a minimum value \(m\) of \(Z=ax+by\), check that the half-plane \(ax+by<m\) has no point in common with the feasible region; for a maximum \(M\), check \(ax+by>M\).
\[\text{Optimise } Z=px+qy\ \text{ subject to }\ a_ix+b_iy\ (\le,\ \ge)\ c_i,\quad x\ge0,\ y\ge0\]
If an LPP has an optimal value, it is attained at a corner point of the feasible region. A bounded feasible region always has both a maximum and a minimum value of \(Z\).
To decide which side of \(ax+by=c\) to shade, substitute a point not on the line (usually the origin). If it satisfies the inequality, shade its side.
If \(Z\) has the same optimal value at two adjacent corners, all points on the edge joining them are optimal.
“At least” means ≥ and “at most” means ≤. Reversing one inequality changes the whole feasible region.
On an unbounded region the largest value in the table need not be a maximum. Draw \(px+qy>M\) and check whether it meets the region.
Maximise \(Z=60x+90y\) subject to \(x+2y\le16,\ x+y\le10,\ x,y\ge0\).
Corner points: \((0,0),(10,0),(4,6),(0,8)\). Values: 0, 600, 780, 720. The region is bounded, so \(Z_{\max}=₹780\) at \((4,6)\): make 4 mugs and 6 bowls.
Untimed mixed questions from all topics. Answers are revealed after you submit.
Start PracticeA 90-minute board-style test on the whole unit “Linear Programming”, drawn fresh from the question bank for every attempt.
Start TestA board-style chapter test drawn fresh from the question bank each time: MCQs, assertion-reason, numericals, written answers you self-check against model solutions, and a case study.
Start TestThen every point on the line segment joining those two corner points is also optimal, so the problem has infinitely many optimal solutions.
Decision variables usually stand for quantities such as numbers of items or hours, which cannot be negative. These non-negativity constraints keep the feasible region in the first quadrant.
Formulation from a word problem, because a wrong constraint makes everything after it wrong. Read each sentence and translate it into one inequality.
Solve a few complete problems on graph paper, from formulation to the corner-point table. Label every line and corner point clearly so the examiner can follow your work.