Algorithms and Applications
Edición de la obra Practical Bilevel Optimization
| Autor | Jonathan F. Bard |
|---|---|
| Editorial | Springer US |
| Fecha de publicación | 1998 |
| Lugar | Boston, MA |
| Idioma | inglés |
| Páginas | 476 |
| Formato | [electronic resource] : |
| ISBN-13 | 9781441948076, 9781475728361 |
| ISBN-10 | 1441948074, 1475728360 |
| OCLC | 851785311 |
| Serie | Nonconvex Optimization and Its Applications -- 30 · Nonconvex optimization and its applications -- 30. |
| Número de Cutter | B245p |
|---|
The focus of this book is on bilevel programming which combines elements of hierarchical optimization and game theory. The basic model addresses the problem where two decision-makers, each with their individual objectives, act and react in a noncooperative 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. Over the last 20 years there has been a steady growth in research related to theory and solution methodologies for bilevel programming. This interest stems from the inherent complexity and consequent challenge of the underlying mathematics, as well as the applicability of the bilevel model to many real-world situations. The primary aim of this book is to provide a historical perspective on algorithmic development and to highlight those implementations that have proved to be the most efficient in their class. A corollary aim is to provide a sampling of applications in order to demonstrate the versatility of the basic model and the limitations of current technology. What is unique about this book is its comprehensive and integrated treatment of theory, algorithms and implementation issues. It is the first text that offers researchers and practitioners an elementary understanding of how to solve bilevel programs and a perspective on what success has been achieved in the field. Audience: Includes management scientists, operations researchers, industrial engineers, mathematicians and economists.