Skip to main content
Discrete mathematics
Lesson 65 of 75
Review

Linear programming

Objective. Optimise objectives over feasible regions.

  1. 1. Learn
  2. 2. Worked example
  3. 3. Practice
  4. 4. Feedback
  5. 5. Continue

Learn: the key idea

Linear programming finds the optimal value of a linear objective function subject to linear inequality constraints, by graphing the feasible region defined by the constraints and evaluating the objective at each vertex of this region, since the optimum of a linear function over a convex region always occurs at a vertex. The method involves plotting all constraint boundaries, shading the feasible region satisfying every inequality simultaneously, identifying its vertices, and substituting each into the objective function to find the maximum or minimum. For example, maximising profit P=3x+2y subject to resource constraints requires checking P at each corner of the feasible polygon.

Worked example

A feasible region for a linear programming problem has vertices (0,0), (4,0), (3,2) and (0,3). Find the maximum value of the objective function P = 2x + 3y over this region.

0 … 0
Illustrated card showing 0 … 0
  1. 1Evaluate P at each vertex: at (0,0), P=0
  2. 2At (4,0), P = 2(4)+3(0) = 8
  3. 3At (3,2), P = 2(3)+3(2) = 6+6 = 12
  4. 4At (0,3), P = 2(0)+3(3) = 9; the maximum of all these values is 12

Answer: Maximum P = 12 at (3,2)

Concept mastery

Based on your past attempts at this lesson — the question types to practise again come first.

Complete a practice set to see your concept breakdown here.

Practice

Practice happens on its own screen, one question at a time. Answers stay hidden until you submit yours, and you can stop and pick up at the same question later.

Start practising

Common mistake. Students check the objective function only at the intersection of all constraint lines rather than at every vertex of the actual feasible region, missing the true optimal corner. Always identify every vertex of the bounded feasible region before comparing objective values.

Your progress

Tick each step as you finish it. Your exact reading position is saved automatically, so Continue drops you back on the same line.

0 of 5 steps complete

Your place saves automatically as you read.

My dashboard