Skip to content

Latest commit

 

History

History

4_linear

readme.md

Linear programming

« Previous | Home ↑ | Next »

Linear Programming (LP) is in some sense the fundamental tool of optimisation and Operations Research (OR). Many real-life problems can be modelled with linear objective function and constraints, and, to date, the Simplex Method for solving LPs is one of the most efficient and powerful algorithms in Operations Research.

Topics
4.1 Example problems and modelling
4.2 Graphical resolution (notebook)
4.3 The simplex algorithm (notebook)
4.4 Solving LP problems with Python

Notebook sessions can be run on:

  • your own computer: there are no specific requirements besides the numpy, matplotlib and scipy libraries.

  • the computer in the classroom. Activate the environment before running Jupyter lab:

    # The following commands only work in the classroom
module load python/3.7
source activate ~x.olive/students

  • Google Colab is a good fallback option, but data files must be uploaded, and solutions to exercices must be checked separately from the Github folder.