Skip to content

MIP 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.

Mixed-integer linear models for making optimal decisions.

Prerequisites: Integer Linear Programming.

Start Exercises Lab Quiz Downloads

Try it now

Three models of the course solved to optimality in the browser: capacitated facility location, lot sizing with a setup cost and projects with logical constraints. Choose the model at the top right, change the data with the sliders and watch the optimal solution, the binaries at 1, the continuous relaxation and the gap.

More apps in the lab

The parts of the course

  • Modelling


    What a MIP is, logic and binary variables, the links between variables (activation, minimum lot, big-M, maxima, if and only if…), lower and upper bounds, the solver.

    The six chapters

  • The problems


    Three families — assignment and scheduling, location and coverage, production planning — plus a chapter of mixed problems, for the problems that have no family. Solved exercises and additional questions.

    The problems

  • The course


    Organization, the format of the exercises, the notes in PDF, the notebooks.

    Organization

Don't miss

  • Exercises


    Modelling exercises for every chapter, at exam level, on the case studies of the course.

    The exercises

  • 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.

    Test yourself

  • Interactive lab


    Apps running in the browser: move the parameters and watch the ideas of the course at work, one step at a time.

    The lab

  • Lecture notes in PDF


    Lecture notes, exercise books and slides in PDF, with the same numbering as the website.

    Downloads

  • Notebooks in Colab


    The code of the course running in the browser, with nothing to install.

    The notebooks

  • Full index


    All the chapters with their sections on one page, and how each chapter is organized.

    The index


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.

  • Mathematical Analysis 1

    real numbers, functions, limits, derivatives and series, with interactive graphs

  • Linear Algebra

    vectors, matrices, determinants, linear systems and eigenvalues, with the computation lab

  • Algorithms

    number representation, pseudo-code, sorting and searching, analysis and recursive algorithms

  • Linear Programming

    polyhedra, the simplex algorithm, duality and the dual simplex, with the interactive lab

  • Integer Linear Programming

    LP relaxation, valid inequalities, cutting planes, branch-and-bound and branch-and-cut

  • Convex Optimization

    convex sets and functions, convex optimization problems, with interactive graphs

  • Network Optimization

    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

  • Dynamic Programming

    principles and DP algorithms for knapsack, lot sizing, coin change and rod cutting

  • Heuristic Algorithms

    constructive heuristics, local search, metaheuristics and MIP heuristics for combinatorial optimization problems

  • Approximation Algorithms

    performance guarantees, approximation schemes and limits of approximation for combinatorial problems

  • LP Modelling

    linear programming models of managerial problems, solved with Python and Gurobi

  • NLP Modelling

    nonlinear programming models, from portfolios to machine learning, with Python and Gurobi

  • MIP Modelling · this course

    integer linear programming models, from the formulation to the solution with solvers


Teaching material by Fabio Furini — DIAG, Sapienza University of Rome.