Practical Bilevel Optimization


Book Description

The use of optimization techniques has become integral to the design and analysis of most industrial and socio-economic systems. Great strides have been made recently in the solution of large-scale problems arising in such areas as production planning, airline scheduling, government regulation, and engineering design, to name a few. Analysts have found, however, that standard mathematical programming models are often inadequate in these situations because more than a single objective function and a single decision maker are involved. Multiple objective programming deals with the extension of optimization techniques to account for several objective functions, while game theory deals with the inter-personal dynamics surrounding conflict. Bilevel programming, the focus of this book, is in a narrow sense the combination of the two. It addresses the problern in which two decision makers, each with their individual objectives, act and react in a noncooperative, sequential manner. The actions of one affect the choices and payoffs available to the other but neither player can completely dominate the other in the traditional sense.




Metaheuristics for Bi-level Optimization


Book Description

This book provides a complete background on metaheuristics to solve complex bi-level optimization problems (continuous/discrete, mono-objective/multi-objective) in a diverse range of application domains. Readers learn to solve large scale bi-level optimization problems by efficiently combining metaheuristics with complementary metaheuristics and mathematical programming approaches. Numerous real-world examples of problems demonstrate how metaheuristics are applied in such fields as networks, logistics and transportation, engineering design, finance and security.




Bilevel Optimization


Book Description

2019 marked the 85th anniversary of Heinrich Freiherr von Stackelberg’s habilitation thesis “Marktform und Gleichgewicht,” which formed the roots of bilevel optimization. Research on the topic has grown tremendously since its introduction in the field of mathematical optimization. Besides the substantial advances that have been made from the perspective of game theory, many sub-fields of bilevel optimization have emerged concerning optimal control, multiobjective optimization, energy and electricity markets, management science, security and many more. Each chapter of this book covers a specific aspect of bilevel optimization that has grown significantly or holds great potential to grow, and was written by top experts in the corresponding area. In other words, unlike other works on the subject, this book consists of surveys of different topics on bilevel optimization. Hence, it can serve as a point of departure for students and researchers beginning their research journey or pursuing related projects. It also provides a unique opportunity for experienced researchers in the field to learn about the progress made so far and directions that warrant further investigation. All chapters have been peer-reviewed by experts on mathematical optimization.




Multilevel Optimization: Algorithms and Applications


Book Description

Researchers working with nonlinear programming often claim "the word is non linear" indicating that real applications require nonlinear modeling. The same is true for other areas such as multi-objective programming (there are always several goals in a real application), stochastic programming (all data is uncer tain and therefore stochastic models should be used), and so forth. In this spirit we claim: The word is multilevel. In many decision processes there is a hierarchy of decision makers, and decisions are made at different levels in this hierarchy. One way to handle such hierar chies is to focus on one level and include other levels' behaviors as assumptions. Multilevel programming is the research area that focuses on the whole hierar chy structure. In terms of modeling, the constraint domain associated with a multilevel programming problem is implicitly determined by a series of opti mization problems which must be solved in a predetermined sequence. If only two levels are considered, we have one leader (associated with the upper level) and one follower (associated with the lower level).




Convex Optimization


Book Description

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.







Bilevel Programming Problems


Book Description

This book describes recent theoretical findings relevant to bilevel programming in general, and in mixed-integer bilevel programming in particular. It describes recent applications in energy problems, such as the stochastic bilevel optimization approaches used in the natural gas industry. New algorithms for solving linear and mixed-integer bilevel programming problems are presented and explained.




Foundations of Bilevel Programming


Book Description

Bilevel programming problems are hierarchical optimization problems where the constraints of one problem (the so-called upper level problem) are defined in part by a second parametric optimization problem (the lower level problem). If the lower level problem has a unique optimal solution for all parameter values, this problem is equivalent to a one-level optimization problem having an implicitly defined objective function. Special emphasize in the book is on problems having non-unique lower level optimal solutions, the optimistic (or weak) and the pessimistic (or strong) approaches are discussed. The book starts with the required results in parametric nonlinear optimization. This is followed by the main theoretical results including necessary and sufficient optimality conditions and solution algorithms for bilevel problems. Stationarity conditions can be applied to the lower level problem to transform the optimistic bilevel programming problem into a one-level problem. Properties of the resulting problem are highlighted and its relation to the bilevel problem is investigated. Stability properties, numerical complexity, and problems having additional integrality conditions on the variables are also discussed. Audience: Applied mathematicians and economists working in optimization, operations research, and economic modelling. Students interested in optimization will also find this book useful.




Algorithms for Optimization


Book Description

A comprehensive introduction to optimization with a focus on practical algorithms for the design of engineering systems. This book offers a comprehensive introduction to optimization with a focus on practical algorithms. The book approaches optimization from an engineering perspective, where the objective is to design a system that optimizes a set of metrics subject to constraints. Readers will learn about computational approaches for a range of challenges, including searching high-dimensional spaces, handling problems where there are multiple competing objectives, and accommodating uncertainty in the metrics. Figures, examples, and exercises convey the intuition behind the mathematical approaches. The text provides concrete implementations in the Julia programming language. Topics covered include derivatives and their generalization to multiple dimensions; local descent and first- and second-order methods that inform local descent; stochastic methods, which introduce randomness into the optimization process; linear constrained optimization, when both the objective function and the constraints are linear; surrogate models, probabilistic surrogate models, and using probabilistic surrogate models to guide optimization; optimization under uncertainty; uncertainty propagation; expression optimization; and multidisciplinary design optimization. Appendixes offer an introduction to the Julia language, test functions for evaluating algorithm performance, and mathematical concepts used in the derivation and analysis of the optimization methods discussed in the text. The book can be used by advanced undergraduates and graduate students in mathematics, statistics, computer science, any engineering field, (including electrical engineering and aerospace engineering), and operations research, and as a reference for professionals.




Generalized Nash Equilibrium Problems, Bilevel Programming and MPEC


Book Description

The book discusses three classes of problems: the generalized Nash equilibrium problems, the bilevel problems and the mathematical programming with equilibrium constraints (MPEC). These problems interact through their mathematical analysis as well as their applications. The primary aim of the book is to present the modern tool of variational analysis and optimization, which are used to analyze these three classes of problems. All contributing authors are respected academicians, scientists and researchers from around the globe. These contributions are based on the lectures delivered by experts at CIMPA School, held at the University of Delhi, India, from 25 November–6 December 2013, and peer-reviewed by international experts. The book contains five chapters. Chapter 1 deals with nonsmooth, nonconvex bilevel optimization problems whose feasible set is described by using the graph of the solution set mapping of a parametric optimization problem. Chapter 2 describes a constraint qualification to MPECs considered as an application of calmness concept of multifunctions and is used to derive M-stationarity conditions for MPEC. Chapter 3 discusses the first- and second-order optimality conditions derived for a special case of a bilevel optimization problem in which the constraint set of the lower level problem is described as a general compact convex set. Chapter 4 concentrates the results of the modelization and analysis of deregulated electricity markets with a focus on auctions and mechanism design. Chapter 5 focuses on optimization approaches called reflection methods for protein conformation determination within the framework of matrix completion. The last chapter (Chap. 6) deals with the single-valuedness of quasimonotone maps by using the concept of single-directionality with a special focus on the case of the normal operator of lower semi-continuous quasiconvex functions.