Integer programming

Defines integer programming and describes a set covering problem, a warehouse location problem, a fixed-charge problem, and integer relaxation.

What is integer programming?
Integer programming is the class of problems defined as the optimization of a linear function subject to linear constraints over integer variables.
Set covering
Describes the problem and presents the model and data files.
Warehouse location
Describes the problem and presents the model and data files.
Fixed-charge problems
Describes the problem and presents the model and data files.
Integer relaxation
Presents a model that shows how to relax integer constraints then undo the relaxation.

Parent topic: Applications of linear and integer programming