Introduction to Mathematical Programming
An introduction to linear optimization, covering geometry, the simplex method, duality, network flows and interior point methods, with notes and problem sets.
Many planning and allocation problems reduce to optimizing a linear objective under constraints. This introduction to linear optimization and its extensions stresses the mathematical structure and geometry behind such problems, alongside the algorithms that solve them. It also covers robust, large-scale and discrete versions, and it has students solve real problems with computer software.
What You Will Achieve
- Formulate practical problems as linear programs
- Use the simplex method and duality theory
- Analyze network flow and large-scale problems
- Apply interior point and discrete optimization methods
Program Overview
Geometry and the Simplex Method
The first part formulates problems and studies the shape of their solutions and how to search them.
- Formulations
- Geometry
- Simplex method
Duality and Sensitivity Analysis
The next part looks at the structure of solutions and how they respond to change.
- Duality theory
- Sensitivity analysis
- Robust optimization
Large Scale and Interior Point Methods
The remaining lectures extend the ideas to harder and larger problem classes.
- Network flows
- The ellipsoid method
- Interior point methods
- Semidefinite and discrete optimization
Course Completion
Job Outlook
These skills are used in operations research, logistics, finance, energy planning and algorithm development.
Good for: Students in operations research, engineering or computer science who want a rigorous foundation in linear optimization, and analysts who model decisions.
Keep in mind: Problem sets come mostly from Bertsimas and Tsitsiklis, Introduction to Linear Optimization, so you need that book. No solutions are listed, and an early computation question uses AMPL.
Bottom line: A strong, book-paired course on optimization theory and algorithms, well worth it if you get the text.
Frequently Asked Questions
Which textbook do the assignments use?
They use Introduction to Linear Optimization by Bertsimas and Tsitsiklis. Each of the seven problem sets lists specific problems from that book, so you will want a copy.
Do the assignments involve computing?
Yes, in part. Early computation questions ask you to solve a production planning problem in AMPL and implement a capacity expansion linear program, using data provided with the assignment.
Does it go beyond linear programs?
Yes. Later lectures cover robust optimization, semidefinite optimization and discrete optimization, as well as problems with exponentially many constraints handled with the ellipsoid method.



There are no reviews yet.