Nonlinear integer programming (Q2493143): Difference between revisions

The goal of the book is to bring the state-of-the-art of the theoretical foundation and solution methods for nonlinear integer programming to readers who are interested in optimization, operations research and computer science. The book systematically investigates theory and solution methodologies for general nonlinear integer programming and provides a comprehensive summary of the theoretical and algorithmic development in the last 30 years on this topic. Main topics with them the book concerns: - Duality theory for nonlinear integer programming. - Convergent Lagrangian and cutting methods for separable nonlinear integer programming problems - Convexification scheme: The relationship between the monotonicity and convexity is explored. thus extending branch-and-bound methods whose success depends on an ability to achieve a global solution ol the continuous relaxation problem. - Computational implementation for large-scale nonlinear integer programming problems with dimensions up to several thousands is demonstrated for several solution algorithms presented in the book. Reviewers's remark: Only a short chapter is dedicated to the more general mixed-integer programming. Readers of this book can be researchers, practitioners, graduate students and senior undergraduate students in operations research and computer science who have basic knowledge of optimization and want to broaden their knowledge in integer programming. The book can be used as a textbook for graduate students in the fields of operations research, management science and computer science. It can be also used as a reference book for researchers, engineers and practitioners to solve real-world application problems by nonlinear integer programming models.