Integer/Discrete Linear Programming/Optimization (ILP)
- is a linear programming (LP) problem where ALL variables are restricted to integer/discrete values
- is usually much more difficult to solve than LP, often we have to apply heuristic or approximative approaches because finding the exact global optimum for a large problem is rarely feasible
- if some variables are mixed between integer values and real values, we call it a Mixed Integer Linear Programming problem
ILP - Structuring the Problem
refer to: ILP - Ways Structuring Problem
ILP - Solving the Problem
refer to: ILP - Algorithms Solving Problem
ILP - Programming Subtypes
refer to: ILP - Programming Subtypes