Integer and Mixed Programming: Theory and Applications

Review of the book
Integer programming is one of the sciences that is becoming more and more popular in the fields of engineering and economics. For such problems, solving with integer variables is much more difficult than with continuous variables. Due to this complexity, every effort has been made in this book to have a balance between theoretical and practical topics to minimize the complexity of the book. This book consists of two parts. In the first part, the introduction of integer programming and solving some examples, binary programming algebra, branch and bound method and real cases are examined. In the second part, the theory of the problem is said to include the binary programming model, the features of the binary programming model, the features of the convex and concave models, the complementary deficiency theorem, and the Gomeri solution method and the linear programming method.

Table of Contents
The headings of this book are as follows:
1- Some examples of integer programming
2- Algebraic theory of binary programming
3- Methods of solving models with integer variables
4- Some complex examples for integer programming
5- Cutting plane method for solving integer programming models
6- Models with continuous variables and integers
7- Practical case examples
8- Algebraic features of binary models
9- Lattice theory
10- Methods of solving binary equations and inequalities
11- Features of the optimal points of Koj and Kav functions
12- Complementary theory of linear programming
13- Danzig planning method
14- Solving linear equations with integer variables
15- Solving integer programming with Gomery cuts
16- Segmentation of linear programming with integer variables