Sie sind bereits eingeloggt. Klicken Sie auf 2. tolino select Abo, um fortzufahren.
Bitte loggen Sie sich zunächst in Ihr Kundenkonto ein oder registrieren Sie sich bei bücher.de, um das eBook-Abo tolino select nutzen zu können.
The methodological development of integer programming has grown by leaps and bounds in the past four decades, with its main focus on linear integer programming. However, the past few years have also witnessed certain promising theoretical and methodological achievements in nonlinear integer programming. In recognition of nonlinearity's academic significance in optimization and its importance in real world applications, Nonlinear Integer Programming is a comprehensive and systematic treatment of the methodology. The book's goal is to bring the state-of-the-art of the theoretical foundation and…mehr
The methodological development of integer programming has grown by leaps and bounds in the past four decades, with its main focus on linear integer programming. However, the past few years have also witnessed certain promising theoretical and methodological achievements in nonlinear integer programming. In recognition of nonlinearity's academic significance in optimization and its importance in real world applications, Nonlinear Integer Programming is a comprehensive and systematic treatment of the methodology. The book's goal is to bring the state-of-the-art of the theoretical foundation and solution methods for nonlinear integer programming to students and researchers in optimization, operations research, and computer science. This book systemically investigates theory and solution methodologies for general nonlinear integer programming, and at the same time, provides a timely and comprehensive summary of the theoretical and algorithmic development in the last 30 years on this topic. TOC:List of figures.- List of tables.- Preface.- Acknowledgments.- Introduction.- Optimality, relaxation and general solution procedures.- Lagrangian duality theory.- Surrogate duality theory.- Nonlinear Lagrangian and strong duality.- Nonlinear knapsack problems.- Separable integer programming.- Nonlinear integer programming with a quadratic objective function.- Nonseparable integer programming.- Unconstrained polynomial 0-1 optimization.- Constrained polynomial 0-1 programming.- Two level methods for constrained polynomial 0-1 programming.- Mixed-integer nonlinear programming.- Global descent methods.- References.- Index.
Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.
Optimality, Relaxation and General Solution Procedures.- Lagrangian Duality Theory.- Surrogate Duality Theory.- Nonlinear Lagrangian and Strong Duality.- Nonlinear Knapsack Problems.- Separable Integer Programming.- Nonlinear Integer Programming with a Quadratic Objective Function.- Nonseparable Integer Programming.- Unconstrained Polynomial 0-1 Optimization.- Constrained Polynomial 0-1 Programming.- Two Level Methods for Constrained Polynomial 0-1 Programming.- Mixed-Integer Nonlinear Programming.- Global Descent Methods.
From the reviews: "This book addresses the topic of the general nonlinear integer programming (NLIP). The overall goal of the book is to bring the state of the art of the theoretical foundations and solution methods of NLIP to readers who are interested in optimization, operations research and computer science. This book investigates the theory and solution methodologies for the general NLIP and provides the developments of the last 30 years. It is assumed that readers are familiar with linear integer programming and the book thus focuses on the theory and solution methodologies of NLIP. The following are some of the features of the book: \roster \item"$\bullet$" Duality theory for NLIP: Investigation into the relationship of the duality gap and the perturbation function has lead to the development of nonlinear Lagrangian theory, thus establishing a methodology for the solution of the NLIP. \item"$\bullet$" Convergent Lagrangian and cutting plane methods for NLIP: Concepts like the objective level cuts, objective contour cuts or the domain cut reshapes the perturbation function. This leads to the optimal solution to lie in the convex hull of the perturbation functions and thus guarantees a zero duality gap. \item"$\bullet$" Convexification scheme: Using the connection between monotonicity and convexity, convexification schemes are developed for monotone and non-convex integer programs, thus extending the reach of branch and bound methods. \item"$\bullet$" Solution framework using global descent: The optimal solution of an NLIP is sought from among the local minima. A theoretical framework is also established to escape from a local minimum. \item"$\bullet$" Computational implications for NLIP: Several NLIPs with up to several thousand variables are solved by solution algorithms presented in this book." (Romesh Saigal, Mathematical Reviews) "The book's goal is to bring the state-of-the-art NIP theoretical foundation and solution methods to students and researchers in optimization, OR, and computer science. ... I think this is an interesting book about NIP and related issues. Many students, professionals, professors, and researchers could use it to learn key concepts about this topic. Therefore, I consider this work a valuable reference for graduate students or researchers interested in integer programming in a wide sense ... ." (Javier Faulin, Interfaces, Vol. 37 (4), 2007) "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. ... Readers of this book can be researchers, practitioners, graduate students and senior undergraduate students ... . 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." (Oleg A. Shcherbina, Zentralblatt MATH, Vol. 1140, 2008)…mehr
Es gelten unsere Allgemeinen Geschäftsbedingungen: www.buecher.de/agb
www.buecher.de ist ein Shop der buecher.de GmbH & Co. KG Bürgermeister-Wegele-Str. 12, 86167 Augsburg Amtsgericht Augsburg HRA 13309