Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming

Review of the book
Currently, there is a large gap between nonlinear integer programming and linear integer programming in the field of solving. With current technologies, it is possible to solve linear integer programming models with millions of variables, while non-linear integer programming problems can be solved with a much smaller number of variables. In this book, we seek to solve non-convex models of nonlinear integer programming with relaxation and decomposition methods.

Table of Contents
The contents of this book are as follows.
1- Introduction to nonlinear integer non-convex programming
2- Formulating
3- Lagrange relaxation and convexification method
4- Analysis methods
5- semi-definite relaxation method
6- Convex estimation
7- The method of cutting the plate and reducing the box
8- Global and local optimization criterion
9- Discretization of infinite integer programming
10- global optimization methods
11- Transformed heuristics
12- Lagrange finders, segmentation and rounding
13- Order of cost solutions and cutting and branching
14- Object oriented approach for nonlinear integer programming