LP Modelling
A course of the Operations Research and Mathematics series · all the courses
Teaching material designed and developed by Fabio Furini, associate professor at DIAG, Sapienza University of Rome.
Linear programming models — the course lecture notes in online form, with Python/Gurobi code, data and reproducible case studies.
Prerequisites: Linear Programming (duality and sensitivity analysis).
Try it now
Three LP models of the course solved to optimality in the browser: production and inventory, electric vehicle charging and the scenario newsvendor. Choose the model at the top right, change demand, capacity, costs or prices with the sliders and the simplex method recomputes the optimal plan, the cost and the shadow prices.
The parts of the course
-
Tools
How a model is built, how it is run, how to read the solution, the shadow prices and the reduced costs: the theory and the solver.
-
Deterministic models
Production and inventory, electric vehicle charging, branch efficiency: every datum is known.
-
Decisions under uncertainty
You decide before you know: the quantile rule, tail risk and the duality that prices financial instruments.
-
Optimization and machine learning
Robust and quantile regression as an LP: absolute deviations, support points from the duals and the quantile the newsvendor needs.
Don't miss
-
Exercises
Modelling exercises for every chapter, at exam level, on the case studies of the course.
-
Self-assessment quiz
A new mock exam at every start: 13 questions, 33 points, with the solution and the link to the notes. Downloads also has the full question bank.
-
Interactive lab
Apps running in the browser: move the parameters and watch the ideas of the course at work, one step at a time.
-
Lecture notes in PDF
Lecture notes, exercise books and slides in PDF, with the same numbering as the website.
-
Notebooks in Colab
The code of the course running in the browser, with nothing to install.
-
Full index
All the chapters with their sections on one page, and how each chapter is organized.
The series
All the courses of the series are built the same way: lecture notes online and in PDF, exercises with solutions, an interactive lab and self-assessment quizzes.
-
real numbers, functions, limits, derivatives and series, with interactive graphs
-
vectors, matrices, determinants, linear systems and eigenvalues, with the computation lab
-
number representation, pseudo-code, sorting and searching, analysis and recursive algorithms
-
polyhedra, the simplex algorithm, duality and the dual simplex, with the interactive lab
-
LP relaxation, valid inequalities, cutting planes, branch-and-bound and branch-and-cut
-
convex sets and functions, convex optimization problems, with interactive graphs
-
graphs, spanning trees, shortest paths, network flows, the network simplex and project management
-
Combinatorial Optimization Problems
knapsack, bin packing, coloring, TSP, scheduling and lot sizing: the problems, their formulations and ad hoc algorithms
-
principles and DP algorithms for knapsack, lot sizing, coin change and rod cutting
-
constructive heuristics, local search, metaheuristics and MIP heuristics for combinatorial optimization problems
-
performance guarantees, approximation schemes and limits of approximation for combinatorial problems
-
LP Modelling · this course
linear programming models of managerial problems, solved with Python and Gurobi
-
nonlinear programming models, from portfolios to machine learning, with Python and Gurobi
-
integer linear programming models, from the formulation to the solution with solvers
Teaching material by Fabio Furini — DIAG, Sapienza University of Rome.