Download Free Exploiting Structure In Non Convex Quadratic Optimization And Gas Network Planning Under Uncertainty Book in PDF and EPUB Free Download. You can read online Exploiting Structure In Non Convex Quadratic Optimization And Gas Network Planning Under Uncertainty and write the review.

The amazing success of computational mathematical optimization over the last decades has been driven more by insights into mathematical structures than by the advance of computing technology. In this vein, Jonas Schweiger addresses applications, where nonconvexity in the model and uncertainty in the data pose principal difficulties. In the first part, he contributes strong relaxations for non-convex problems such as the non-convex quadratic programming and the Pooling Problem. In the second part, he contributes a robust model for gas transport network extension and a custom decomposition approach. All results are backed by extensive computational studies.
This book gathers a selection of peer-reviewed papers presented at the International Conference on Operations Research (OR 2018), which was held at the Free University of Brussels, Belgium on September 12 - 14, 2018, and was jointly organized by the German Operations Research Society (GOR) and the Belgian Operational Research Society (ORBEL). 575 scientists, practitioners and students from mathematics, computer science, business/economics and related fields attended the conference and presented more than 400 papers in parallel topic streams, as well as special award sessions. The respective papers discuss classical mathematical optimization, statistics and simulation techniques. These are complemented by computer science methods, and by tools for processing data, designing and implementing information systems. The book also examines recent advances in information technology, which allow big data volumes to be processed and enable real-time predictive and prescriptive business analytics to drive decisions and actions. Lastly, it includes problems modeled and treated while taking into account uncertainty, risk management, behavioral issues, etc.
Convex optimization problems arise frequently in many different fields. This book provides a comprehensive introduction to the subject, and shows in detail how such problems can be solved numerically with great efficiency. The book begins with the basic elements of convex sets and functions, and then describes various classes of convex optimization problems. Duality and approximation techniques are then covered, as are statistical estimation techniques. Various geometrical problems are then presented, and there is detailed discussion of unconstrained and constrained minimization problems, and interior-point methods. The focus of the book is on recognizing convex optimization problems and then finding the most appropriate technique for solving them. It contains many worked examples and homework exercises and will appeal to students, researchers and practitioners in fields such as engineering, computer science, mathematics, statistics, finance and economics.
Many engineering, operations, and scientific applications include a mixture of discrete and continuous decision variables and nonlinear relationships involving the decision variables that have a pronounced effect on the set of feasible and optimal solutions. Mixed-integer nonlinear programming (MINLP) problems combine the numerical difficulties of handling nonlinear functions with the challenge of optimizing in the context of nonconvex functions and discrete variables. MINLP is one of the most flexible modeling paradigms available for optimization; but because its scope is so broad, in the most general cases it is hopelessly intractable. Nonetheless, an expanding body of researchers and practitioners — including chemical engineers, operations researchers, industrial engineers, mechanical engineers, economists, statisticians, computer scientists, operations managers, and mathematical programmers — are interested in solving large-scale MINLP instances.
Robust optimization is still a relatively new approach to optimization problems affected by uncertainty, but it has already proved so useful in real applications that it is difficult to tackle such problems today without considering this powerful methodology. Written by the principal developers of robust optimization, and describing the main achievements of a decade of research, this is the first book to provide a comprehensive and up-to-date account of the subject. Robust optimization is designed to meet some major challenges associated with uncertainty-affected optimization problems: to operate under lack of full information on the nature of uncertainty; to model the problem in a form that can be solved efficiently; and to provide guarantees about the performance of the solution. The book starts with a relatively simple treatment of uncertain linear programming, proceeding with a deep analysis of the interconnections between the construction of appropriate uncertainty sets and the classical chance constraints (probabilistic) approach. It then develops the robust optimization theory for uncertain conic quadratic and semidefinite optimization problems and dynamic (multistage) problems. The theory is supported by numerous examples and computational illustrations. An essential book for anyone working on optimization and decision making under uncertainty, Robust Optimization also makes an ideal graduate textbook on the subject.
The techniques described in this monograph form the basis of running an optimally efficient modern day power system. It is a must-read for all students and researchers working on the cutting edge of electric power systems.
"This book deals with a simple sounding question whether a certain amount of gas can be transported by a given pipeline network. While well studied for a single pipeline, this question gets extremely difficult if we consider a meshed nation wide gas transportation network, taking into account all the technical details and discrete decisions, as well as regulations, contracts, and varying demand. This book describes several mathematical models to answer these questions, discusses their merits and disadvantages, explains the necessary technical and regulatory background, and shows how to solve this question using sophisticated mathematical optimization algorithms."--
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.