Joining the INP
Joining a school
Sign up
Welcome booklet
School / Prep
ENSEIRB-MATMECA
Internal code
EI6IF127
Description
Linear programming and its version with integer variables are powerful tools for modeling and solving combinatorial optimization problems. This course aims to introduce mathematical modeling in the form of linear and integer linear programs, as well as the algorithmic methods used to solve these models using the simplex algorithm and dedicated branch-and-bound methods.
Teaching hours
- CMLectures5h
- TDTutorial10h
Mandatory prerequisites
Basic linear algebra and algorithms.
Syllabus
Linear programming
Simplex algorithm
Integer linear programming (PLNE)
Branch-and-bound algorithms for PLNE
Further information
Mathematical optimization
Bibliography
Course slides and TD statements are available online on the Moodle course.
Assessment of knowledge
Initial assessment / Main session - Tests
| Type of assessment | Type of test | Duration (in minutes) | Number of tests | Test coefficient | Eliminatory mark in the test | Remarks |
|---|---|---|---|---|---|---|
| Final inspection | Written | 120 | 0.5 | without document | ||
| Continuous control | Continuous control | 0.5 |