Nonlinear And Mixed Integer Optimization

Download Nonlinear And Mixed Integer Optimization PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Nonlinear And Mixed Integer Optimization book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Nonlinear and Mixed-Integer Optimization

Author: Christodoulos A. Floudas
language: en
Publisher: Oxford University Press
Release Date: 1995-10-05
This volume presents the fundamentals of nonlinear and mixed-integer optimisation, and their applications in the important area of process synthesis in chemical engineering. Topics that are unique include the theory and methods for mixed-integer nonlinear optimisation, introduction to modelling issues in process synthesis, and optimisation-based approaches in the synthesis of heat recovery systems, distillation-based systems, and reactor-based systems.
Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming

Author: Mohit Tawarmalani
language: en
Publisher: Springer Science & Business Media
Release Date: 2013-04-17
Interest in constrained optimization originated with the simple linear pro gramming model since it was practical and perhaps the only computationally tractable model at the time. Constrained linear optimization models were soon adopted in numerous application areas and are perhaps the most widely used mathematical models in operations research and management science at the time of this writing. Modelers have, however, found the assumption of linearity to be overly restrictive in expressing the real-world phenomena and problems in economics, finance, business, communication, engineering design, computational biology, and other areas that frequently demand the use of nonlinear expressions and discrete variables in optimization models. Both of these extensions of the linear programming model are NP-hard, thus representing very challenging problems. On the brighter side, recent advances in algorithmic and computing technology make it possible to re visit these problems with the hope of solving practically relevant problems in reasonable amounts of computational time. Initial attempts at solving nonlinear programs concentrated on the de velopment of local optimization methods guaranteeing globality under the assumption of convexity. On the other hand, the integer programming liter ature has concentrated on the development of methods that ensure global optima. The aim of this book is to marry the advancements in solving nonlinear and integer programming models and to develop new results in the more general framework of mixed-integer nonlinear programs (MINLPs) with the goal of devising practically efficient global optimization algorithms for MINLPs.
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization

Author: Stefan Rocktäschel
language: en
Publisher: Springer Nature
Release Date: 2020-01-21
Stefan Rocktäschel introduces a branch-and-bound algorithm that determines a cover of the efficient set of multiobjective mixed-integer convex optimization problems. He examines particular steps of this algorithm in detail and enhances the basic algorithm with additional modifications that ensure a more precise cover of the efficient set. Finally, he gives numerical results on some test instances.