This chapter introduces basic models for mixed-integer linear programming. It starts with multiple-choice constraints, and implications that are formulated as inequalities with 0-1 variables. Next, constraints with continuous variables are introduced, such as discontinuous domains and cost functions with fixed charges, which are formulated as linear mixed-integer constraints. Finally, the chapter closes by introducing classic OR problems, the assignment problem, facility location problem, knapsack problem, set covering problem and the traveling salesman problem, all of which are formulated as linear integer and mixed-integer linear programming models.
Review the options below to login to check your access.
Log in with your Cambridge Higher Education account to check access.
If you believe you should have access to this content, please contact your institutional librarian or consult our FAQ page for further information about accessing our content.