Mixed-integer programming.

In this lesson we present several examples of mixed-integer programming problems. The aim is to convince the reader about the power of these methods and invite him/her to think in optimization problem when faced with real life problems. The possibility of using binary variables is very attractive and useful. Here we describe The knapsack, the ship owner, the relevant symptoms, the academy selection, the school timetable and the discrete location problems. They are very simple problems, but will suggest the reader a wide variety of applications.