- Premium
- Higher Mathematics
- 10 lessons
- About 2 h 58 min
Linear Programming: Advanced
Advanced course on Linear Programming (Higher Mathematics): harder problems and exam-level speed.
Start: Sensitivity: how far can a profit change before the optimum moves?
Sign in to keep track of your progress.
About this course
Advanced course on Linear Programming (Higher Mathematics): harder problems and exam-level speed.
What you will learn, lesson by lesson
- Sensitivity: how far can a profit change before the optimum moves? Find the range of a profit or cost coefficient over which a corner stays optimal, prove optimality with non-negative multipliers, and predict the new optimum when a coefficient leaves its range.
- Parameters in the objective: every value of k For an objective such as Z = kx + y, find for every real k (negative values included) which corner is optimal, which values give infinitely many optima, and when the optimum stops existing on an unbounded region.
- Parameters in the constraints Find the values of a parameter in a constraint that make the region non-empty, write the optimum as a piecewise function of a right-hand side, and read off the rate at which the optimum grows.
- Redundant and binding constraints, and the value of a resource Show that a constraint is redundant with a combination of the others, tell binding constraints from those with slack, and use the multipliers at the optimum to predict how the optimum changes when a resource grows.
- Hard mixed problems Solve harder variants: regions with no sign conditions such as |x| + |y| ≤ 3, whole-number cost problems where rounding fails badly, and reverse problems where the optimum is given and a parameter must be found.
- Final self-assessment: Linear programming advanced Test yourself on the whole course: 15 questions with answers explained.
Lessons in this course
- 1 Sensitivity: how far can a profit change before the optimum moves? About 17 min Free preview
- 2 Parameters in the objective: every value of k About 17 min Premium
- 3 Parameters in the constraints About 17 min Premium
- 4 Redundant and binding constraints, and the value of a resource About 17 min Premium
- 5 Hard mixed problems About 18 min Premium
- 6 Three variables and an equation: reducing the problem to two About 16 min Premium
- 7 Absolute values and minimax: minimise the larger, maximise the smaller About 16 min Premium
- 8 Distance and ratio objectives: when the corner is not enough About 16 min Premium
- 9 Degenerate corners and optimal rays: describing every solution About 16 min Premium
- 10 Final self-assessment: Linear programming advanced About 28 min Premium
Questions about this course
Should I do Foundation first?
If Linear Programming is new to you, yes. Start with Linear Programming: Foundation, then Practice, and come back to this course after.
Is this course free?
This is a premium course. Lessons marked “Free preview” are open to everyone.
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.