Explores optimization problems in which some or all of the individual data involved depends on one parameter. Beginning with a preliminary survey of solution algorithms in one-parametric optimization, the text moves on to examine the pathfollowing curves of local minimizers, pathfollowing along a connected component in the Karush-Kuhn-Tucker set and in the critical set, pathfollowing in the set of local minimizers and in the set of critical points. In addition, practical applications are included.
Optimality and stability are two important notions in applied mathematics. This book is a study of these notions and their relationship in linear and convex parametric programming models. It begins with a survey of basic optimality conditions in nonlinear programming. Then new results in convex programming, using LFS functions, for single-objective, multi-objective, differentiable and non-smooth programs are introduced. Parametric programming models are studied using basic tools of point-to-set topology. Stability of the models is introduced, essentially, as continuity of the feasible set of decision variables under continuous perturbations of the parameters. Perturbations that preserve this continuity are regions of stability. It is shown how these regions can be identified. The main results on stability are characterizations of locally and globally optimal parameters for stable and also for unstable perturbations. The results are straightened for linear models and bi-level programs. Some of the results are extended to abstract spaces after considering parameters as `controls'. Illustrations from diverse fields, such as data envelopment analysis, management, von Stackelberg games of market economy, and navigation problems are given and several case studies are solved by finding optimal parameters. The book has been written in an analytic spirit. Many results appear here for the first time in book form. Audience: The book is written at the level of a first-year graduate course in optimization for students with varied backgrounds interested in modeling of real-life problems. It is expected that the reader has been exposed to a prior elementary course in optimization, such as linear or non-linear programming. The last section of the book requires some knowledge of functional analysis.
The standard view of Operations Research/Management Science (OR/MS) dichotomizes the field into deterministic and probabilistic (nondeterministic, stochastic) subfields. This division can be seen by reading the contents page of just about any OR/MS textbook. The mathematical models that help to define OR/MS are usually presented in terms of one subfield or the other. This separation comes about somewhat artificially: academic courses are conveniently subdivided with respect to prerequisites; an initial overview of OR/MS can be presented without requiring knowledge of probability and statistics; text books are conveniently divided into two related semester courses, with deterministic models coming first; academics tend to specialize in one subfield or the other; and practitioners also tend to be expert in a single subfield. But, no matter who is involved in an OR/MS modeling situation (deterministic or probabilistic - academic or practitioner), it is clear that a proper and correct treatment of any problem situation is accomplished only when the analysis cuts across this dichotomy.
This volume contains the proceedings of the third conference on Parametric Optimization and Related Topics, held in Gustrow from 30 August until 5 September, 1991. Parametric optimization, as a part of mathematical programming, investigates the behaviour of solutions to optimization problems under data pertubations. This behaviour, like continuity and differentiability, plays a fundamental role for a series of further questions that are of interest from a practical as well as a theoretical point of view. Many relations to other disciplines of operations research, like stochastic programming, modelbuilding, numerical methods, multiobjective optimization and optimal control, originate from this behaviour. The presented articles (all refereed) are topical and original papers reflecting recent results to current directions of research in theory and applications."
A large number of mathematical models in many diverse areas of science and engineering have lead to the formulation of optimization problems where the best solution (globally optimal) is needed. This book covers a small subset of important topics in global optimization with emphasis on theoretical developments and scientific applications.
This book focuses on Augmented Lagrangian techniques for solving practical constrained optimization problems. The authors rigorously delineate mathematical convergence theory based on sequential optimality conditions and novel constraint qualifications. They also orient the book to practitioners by giving priority to results that provide insight on the practical behavior of algorithms and by providing geometrical and algorithmic interpretations of every mathematical result, and they fully describe a freely available computational package for constrained optimization and illustrate its usefulness with applications.
This comprehensive work examines important recent developments and modern applications in the fields of optimization, control, game theory and equilibrium programming. In particular, the concepts of equilibrium and optimality are of immense practical importance affecting decision-making problems regarding policy and strategies, and in understanding and predicting systems in different application domains, ranging from economics and engineering to military applications. The book consists of 29 survey chapters written by distinguished researchers in the above areas.
