Solving the integer linear programming problem

The purpose of this thesis is to consider both the development and the workings of some selected methods to solve the integer linear programming problem.

Chapter I introduces the general theory of linear programming. Both the simplex and the dual simplex method are introduced along with a summary of the general steps of the algorithms.

Chapter II is an introduction to the integer linear programming problem. The characteristics of the integer problem are discussed as well as an overview of the methods used to solve them.

Chapter III is concerned with two specific methods used to solve integer problems. They are cutting plane methods and apply to the pure and the mixed integer problem respectively. Both are developed in detail and an example of each is given.

Chapter IV is also concerned with a specific method. The method is a combination of a primal method with an enumerative method. The theory behind the method is discussed and an example is given.