Syllabus
Every chapter starts from a concrete managerial problem — how much to produce, how to charge a fleet, how efficient a branch is, how much risk to accept — turns it into a linear programming model, solves it with Gurobi called from Python and, above all, interrogates it: how much is one extra hour of capacity worth? Does the solution hold if the data change by 5%?
Every model can be run right away in the browser: each chapter has its own notebook that opens in Colab, with nothing to install.
The right question
At the end of every lab session the question is not only “what is the optimum?”, but “which decision do we recommend and how robust is it?”. All the decision variables are continuous and every model is linear: we read the solution through duality, shadow prices and reduced costs.
The complete list of the chapters, in the order in which they are covered. Every chapter has its own page, its own Python script and its own notebook that opens in Colab.
- Introduction to LP modelling — this page and the home page
- Theory: linear programming — duality, shadow prices, sensitivity protocol
- Solver, linear models — building the model, running it, retrieving the solution, interpreting the output
- Multi-period production and inventory — LP
- Electric vehicle charging — LP
- Data Envelopment Analysis — LP and duality
- The Newsvendor and its variants — stochastic LP
- VaR and CVaR — scenario-based LP
- Arbitrage and pricing — LP and duality that prices
Optimization and machine learning
The course
- Organization of the lab — lab sessions and mistakes to avoid
Prerequisite: the module Linear Programming, in particular duality and sensitivity analysis. Quadratic and nonlinear models are in the module NLP Modelling.
The four parts and what each one is for are described on the home page.