Characterizing optimality in mathematical programming models
From MaRDI portal
Publication:1108200
DOI10.1007/BF00047497zbMath0653.90073MaRDI QIDQ1108200
Publication date: 1988
Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)
surveymulti-objective optimizationoptimality conditionsoptimal value functionpoint-to-set mappingsLagrangian functionsinput constraint qualificationsinput optimizationregions of stabilitystructural optimality
Sensitivity, stability, well-posedness (49K40) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Set-valued maps in general topology (54C60) Special maps on topological spaces (open, closed, perfect, etc.) (54C10) Programming in abstract spaces (90C48) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Optimality conditions for problems in abstract spaces (49K27)
Related Items
A saddle-point characterization of Pareto optima, Stable parametric programming*, The marginal value formula in input optimization, Convex Parametric Programming in Abstract Spaces, Simulation-based classification; a model-order-reduction approach for structural health monitoring, Partly convex programming and Zermelo's navigation problems, Lipschitzian stability of constraint systems and generalized equations, Multiple and Unacceptable Solutions in Nonlinear Programming Discriminant Analysis, Method of reduction in convex programming, On first order optimality conditions for vector optimization, The marginal value formula on regions of stability, Wald's mighty maximin: a tutorial, Bilevel convex programming models, BOLIB: Bilevel Optimization LIBrary of Test Problems
Cites Work
- Second-order and related extremality conditions in nonlinear programming
- Introduction to sensitivity and stability analysis in nonlinear programming
- The essence of invexity
- Computable bounds on parametric solutions of convex problems
- On sufficiency of the Kuhn-Tucker conditions
- Vector-valued optimization problems in control theory. Transl. from the Russian by John L. Casti
- Partially finite convex programming. II: Explicit lattice models
- On the continuity of the maximum in parametric linear programming
- A simplified test for optimality
- Calcul sous-différentiel et optimisation
- Theorems of the alternative and optimality conditions
- Proper efficiency and the theory of vector maximization
- Necessary and Sufficient Conditions for a Local Minimum. 1: A Reduction Theorem and First Order Conditions
- Linear parametric programming—A brief survey
- On minimization subject to cone constraints
- Stabilization and determination of the set of minimal binding constraints in convex programming1
- Optimization and nonsmooth analysis
- Input optimization: I. Optimal realizations of mathematical models
- On stability and stationary points in nonlinear optimization
- Input optimization: III. optimal realizations of multiobjective models
- Nonsmooth Calculus in Finite Dimensions
- Survey of input optimization1
- A network model for nursing staff scheduling
- Generalized convexity and concavity of the optimal value function in nonlinear programming
- New regions of stability in input optimization
- Directional Behaviour of Optimal Solutions in Nonlinear Mathematical Programming
- Stability of efficiency evaluations in data envelopment analysis
- Constraint qualifications in input optimisation
- Generalized Directional Derivatives and Subgradients of Nonconvex Functions
- Invex functions and constrained local minima
- Further Generalizations of Convexity in Mathematical Programming
- Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
- Characterizations of optimality without constraint qualification for the abstract convex program
- Various definitions of the derivative in mathematical programming
- Generalized Gradients and Applications
- Stability Theory for Systems of Inequalities. Part I: Linear Systems
- On the lower semicontinuity of optimal sets in convex parametric optimization
- An introduction to the theory of nonsmooth optimization
- Characterizing an optimal input in perturbed convex programming
- Point-to-Set Maps in Mathematical Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
