• Free
  • Higher Mathematics
  • 10 lessons
  • About 2 h 42 min

Linear Programming: Foundation

Foundation course on Linear Programming (Higher Mathematics): the basics, explained from the start.

Start: Linear inequalities and half-planes

Sign in to keep track of your progress.

About this course

Foundation course on Linear Programming (Higher Mathematics): the basics, explained from the start.

What you will learn, lesson by lesson

  1. Linear inequalities and half-planes Read an inequality such as 2x + 3y ≤ 12 as a region of the plane, draw its boundary line from the intercepts, pick the correct side with a test point and tell solid boundaries from dashed ones.
  2. Systems of inequalities and the feasible region Combine several inequalities into one common region, find its corner points by solving pairs of boundary lines, and recognise bounded, unbounded and empty regions.
  3. Parts of a linear programming problem and formulation Name the decision variables, objective function, constraints and non-negativity conditions of a linear programming problem, and turn manufacturing, diet and investment word problems into mathematical form.
  4. The corner-point method for bounded regions Solve a linear programming problem whose feasible region is bounded: list its corner points, evaluate the objective at each and pick the largest or smallest value.
  5. Unbounded regions, infeasible problems and multiple optima Decide whether an optimum exists on an unbounded region using the open half-plane test, recognise problems with no feasible point, and spot when a whole edge of the region is optimal.
  6. Final self-assessment: Linear programming basics Test yourself on the whole course: 15 questions with answers explained.

Lessons in this course

  1. 1 Linear inequalities and half-planes About 14 min Start
  2. 2 Systems of inequalities and the feasible region About 15 min Start
  3. 3 Parts of a linear programming problem and formulation About 16 min Start
  4. 4 The corner-point method for bounded regions About 16 min Start
  5. 5 Unbounded regions, infeasible problems and multiple optima About 17 min Start
  6. 6 Special inequalities: vertical lines, horizontal lines and lines through the origin About 14 min Start
  7. 7 Slack, binding constraints and checking a plan About 14 min Start
  8. 8 The objective function as a family of parallel lines About 15 min Start
  9. 9 Formulating and solving: a scheduling problem and a blending problem About 16 min Start
  10. 10 Final self-assessment: Linear programming basics About 25 min Start

Questions about this course

Is this course free?

Yes. Every lesson in this course is free to read.

How do I keep track of what I've finished?

Create a free account and sign in. Each lesson you finish is saved to your account and shown here and on your dashboard.

Student reviews

No reviews yet. Students who finish a lesson can rate this course.

Keep going

Privacy · Terms · Refunds · Delivery