Revision notes

Linear Programming: Foundation

The key points, rules to remember, tables and diagrams from all 9 lessons, on one page for quick revision. To keep a copy, use your browser's Print and choose "Save as PDF".

Lesson 1

Linear inequalities and half-planes

Five inequalities and their half-planes
InequalityBoundary lineTest pointResultRegion
2x + 3y ≤ 12through (6, 0) and (0, 4)(0, 0): 0 ≤ 12trueorigin side, line included
x + y ≥ 5through (5, 0) and (0, 5)(0, 0): 0 ≥ 5falseside away from the origin, line included
y ≤ 2xthrough (0, 0) and (1, 2)(1, 0): 0 ≤ 2trueside containing (1, 0), below the line
x ≤ 4vertical line x = 4(0, 0): 0 ≤ 4trueleft of the line
y ≥ 1horizontal line y = 1(0, 0): 0 ≥ 1falseabove the line

To graph ax + by ≤ c: draw ax + by = c through its intercepts (solid for ≤ or ≥, dashed for < or >), substitute a test point not on the line, usually (0, 0), and shade the side where the inequality is true.

Key takeaways: a linear inequality in x and y is a half-plane. Find the boundary from its intercepts, test a point not on the line, and shade the true side. x ≥ 0 and y ≥ 0 together keep you in the first quadrant. A point on a solid boundary satisfies the inequality.

Read the full lesson

Lesson 2

Systems of inequalities and the feasible region

Testing every intersection
Intersection ofPointCheck the other constraintsCorner?
x = 0 and y = 0(0, 0)0 ≤ 6, 0 ≤ 8yes
x + y = 6 and y = 0(6, 0)x + 2y = 6 ≤ 8yes
x + 2y = 8 and y = 0(8, 0)x + y = 8, not ≤ 6no
x + 2y = 8 and x = 0(0, 4)x + y = 4 ≤ 6yes
x + y = 6 and x = 0(0, 6)x + 2y = 12, not ≤ 8no
x + y = 6 and x + 2y = 8(4, 2)x ≥ 0, y ≥ 0yes
Type of regionWhat it looks likeExample from this lesson
Boundeda closed polygonx + y ≤ 6, x + 2y ≤ 8, x, y ≥ 0
Unboundedruns off to infinity in some directionx + y ≥ 4, x + 3y ≥ 6, x, y ≥ 0
Emptyno point obeys every conditionx + 2y ≤ 4, 2x + 3y ≥ 12, x, y ≥ 0

A corner point is an intersection of two boundary lines that satisfies every constraint. Find all intersections, then reject any that break a constraint.

Key takeaways: the feasible region is the overlap of all the half-planes. Its corners come from solving boundary lines in pairs and keeping only the points that obey every inequality. A region can be bounded, unbounded or empty, and you should always say which before going further.

Read the full lesson

Lesson 3

Parts of a linear programming problem and formulation

ResourceTable (x)Chair (y)Available
Carpentry hours3130
Polishing hours1220
Profit (₹)500300

An LPP: maximise or minimise Z = px + qy subject to linear constraints and x ≥ 0, y ≥ 0. "At most" gives ≤, "at least" gives ≥, and each constraint is read along one row of the data table.

Key takeaways: define the variables first, with units. Build a data table and read each constraint along a row. Translate the words carefully, including comparisons such as "at least twice", and check a translated constraint by trying a pair of numbers. Never forget the non-negativity conditions.

Read the full lesson

Lesson 4

The corner-point method for bounded regions

Corner point theorem: if the feasible region is bounded and not empty, Z = px + qy has a maximum and a minimum on it, and each occurs at a corner point of the region.

CornerZ = 500x + 300y
(0, 0)0
(10, 0)5000
(8, 6)4000 + 1800 = 5800
(0, 10)3000
CornerZ = 3x + 2y
(4, 0)12
(6, 0)18
(6, 3)24
(0, 6)12
(0, 4)8

Key takeaways: on a bounded feasible region the optimum of a linear objective is at a corner. List the feasible corners, tabulate Z, pick the largest or smallest, and translate the answer back into the story.

Read the full lesson

Lesson 5

Unbounded regions, infeasible problems and multiple optima

Unbounded region: let M and m be the largest and smallest corner values of Z. M is the maximum only if px + qy > M has no point in the region; m is the minimum only if px + qy < m has no point in the region.

SituationHow to recognise itConclusion
Bounded regionclosed polygonmax and min both exist at corners
Unbounded regionruns off to infinitytest the open half-plane before accepting a corner value
Empty regionconstraints contradictno feasible solution
Tie at two adjacent cornersobjective parallel to an edgeinfinitely many optimal points on that edge

Key takeaways: on an unbounded region the best corner value is only a candidate: confirm it with the open half-plane test. An empty region means no solution at all. A tie between adjacent corners means a whole edge of optimal solutions.

Read the full lesson

Lesson 6

Special inequalities: vertical lines, horizontal lines and lines through the origin

If the origin lies on the boundary line, test another point such as (1, 0) or (0, 1). Never use a point that lies on the line itself.

Key takeaways: x ≤ a and y ≥ b are vertical and horizontal half-planes; when the origin lies on the boundary, test another point; reverse the sign when multiplying by a negative number; a double inequality is two inequalities; list corners by solving each pair of boundary lines and checking the rest.

Read the full lesson

Lesson 7

Slack, binding constraints and checking a plan

A corner point of a two-variable feasible region lies on at least two boundary lines, so at least two constraints (counting x ≥ 0 and y ≥ 0) are binding there.

Corner2x + y ≤ 10x + 3y ≤ 15Binding constraints
(0, 0)slack 10slack 15x ≥ 0 and y ≥ 0
(5, 0)slack 0slack 102x + y ≤ 10 and y ≥ 0
(3, 4)slack 0slack 0both resource limits
(0, 5)slack 5slack 0x + 3y ≤ 15 and x ≥ 0

Key takeaways: feasibility means every constraint holds; slack is c minus the left side for ≤ constraints, surplus is the left side minus c for ≥ constraints; zero means binding; a corner has at least two binding constraints.

Read the full lesson

Lesson 8

The objective function as a family of parallel lines

Z = px + qy gives a family of parallel lines. To maximise Z, slide the line away from the origin as far as it still touches the feasible region; to minimise, slide it towards the origin. The last touching point is the optimum.

Key takeaways: each value of Z gives a line, and all such lines are parallel; maximising pushes the line away from the origin, minimising pulls it towards the origin (for positive coefficients); the optimum is the last touching point, so it is a corner or a whole edge; compare slopes to see which corner it will be.

Read the full lesson

Lesson 9

Formulating and solving: a scheduling problem and a blending problem

CornerZ = 30x + 40y
(0, 0)0
(7, 0)210
(4, 6)120 + 240 = 360
(0, 8)320
CornerZ = 5x + 4y
(0, 12)48
(3, 3)15 + 12 = 27
(12, 0)60

Key takeaways: follow the six-step routine; solve each pair of binding lines for the corner; tabulate Z; for an unbounded region confirm the minimum with a combination of the constraints; state the answer in words with units.

Read the full lesson

Privacy · Terms · Refunds · Delivery