Mixed Integer Linear Programming (MILP) is about finding an integer point
in a polytope that maximizes the value of some given linear form. It is a
NP-complete problem whose expressivity allows to model various hard
combinatorial problems. Such problems can therefore be solved efficiently
through a MILP solver.