Chapter 7 A Integer Linear Programming

What is a 0-1 Integer Model (Binary ILP)?

A type of integer linear programming where decision variables can only be 0 or 1.

What is a Mixed-Integer Model (MILP)?

A model where some variables must be integers while others can be continuous.

What is LP Relaxation?

The process of solving an integer linear programming problem as a linear program, ignoring the integer constraints.

What is Feasibility in integer programming?

A solution is feasible if it satisfies all constraints of the integer program.

What is an Optimal Solution?

The best feasible solution that maximizes or minimizes the objective function while satisfying constraints.

What are Rounding Heuristics?

A method to convert fractional solutions from LP relaxation into feasible integer solutions.

What is Branch and Bound?

A systematic method for solving integer programming problems by dividing them into smaller subproblems.

What is Complete Enumeration?

A method that involves evaluating all possible integer solutions to identify the best one.

What is the Graphical Solution Method?

A visual approach to solving small integer programming problems by plotting feasible integer points.