Some selected methods for solution to the integer linear programming problem
The purpose of this thesis is to consider some algorithms for the solution to the integer linear programming problem.
Chapter I introduces the linear programming problem, the simplex method and the dual simplex method, along with some theoretical basis for these methods.
Chapter II addressed the primal integer programming algorithm to solve primal feasible, but not optimal, integer linear programming problem. The finiteness of iterations in this algorithm is also proved.
Chapter III discusses the primal - dual integer programming algorithm for solving the primally and dually infeasible integer linear programming problem.
Chapter IV introduces Balas' additive algorithm for solving the 0 - 1 linear programming problem.
Since the integer linear programming problem may have many variables and constraints, sometimes it is impossible to solve them by hand. Flowcharts for the primal integer programming algorithm and Balas' additive algorithm are presented in Chapter II and Chapter IV. Computer programs can be easily developed based on these flowcharts to execute the algorithms for solving the linear integer programming problem.
Thesis78.C375.pdf
3.45 MB
Adobe PDF
bac4a03cbdea168daecf79351812d94c