Characterizing optimality in mathematical programming models
type: Item
instance of: scholarly article
title: Characterizing optimality in mathematical programming models
zbMATH Open document ID: 0653.90073
DOI: 10.1007/BF00047497
published in: Acta Applicandae Mathematicae
publication date: 1988-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 49K27
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C48
Mathematics Subject Classification ID: 49K40
Mathematics Subject Classification ID: 54C10
Mathematics Subject Classification ID: 54C60
Mathematics Subject Classification ID: 90-02
zbMATH DE Number: 4066643
zbMATH Keywords: structural optimality
zbMATH Keywords: optimality conditions
zbMATH Keywords: point-to-set mappings
zbMATH Keywords: input optimization
zbMATH Keywords: regions of stability
zbMATH Keywords: Lagrangian functions
zbMATH Keywords: input constraint qualifications
zbMATH Keywords: multi-objective optimization
zbMATH Keywords: survey
zbMATH Keywords: optimal value function
author: Sanjo Zlobec
MaRDI profile type: Publication
cites work: A simplified test for optimality
cites work: Q4135211
cites work: Q3037158
cites work: Q3902815
cites work: Second-order and related extremality conditions in nonlinear programming
cites work: Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
cites work: Q5722776
cites work: Characterizations of optimality without constraint qualification for the abstract convex program
cites work: Q3294638
cites work: Q5597327
cites work: Stability of efficiency evaluations in data envelopment analysis
cites work: Generalized Gradients and Applications
cites work: Optimization and nonsmooth analysis
cites work: Q3710285
cites work: Q3771979
cites work: Invex functions and constrained local minima
cites work: On minimization subject to cone constraints
cites work: Introduction to sensitivity and stability analysis in nonlinear programming
cites work: Computable bounds on parametric solutions of convex problems
cites work: Linear parametric programming—A brief survey
cites work: Directional Behaviour of Optimal Solutions in Nonlinear Mathematical Programming
cites work: Proper efficiency and the theory of vector maximization
cites work: Theorems of the alternative and optimality conditions
cites work: On stability and stationary points in nonlinear optimization
cites work: On sufficiency of the Kuhn-Tucker conditions
cites work: Further Generalizations of Convexity in Mathematical Programming
cites work: Q4093215
cites work: Q4175062
cites work: Q3661323
cites work: Point-to-Set Maps in Mathematical Programming
cites work: New regions of stability in input optimization
cites work: Necessary and Sufficient Conditions for a Local Minimum. 1: A Reduction Theorem and First Order Conditions
cites work: Q5791470
cites work: Q3667658
cites work: On the lower semicontinuity of optimal sets in convex parametric optimization
cites work: Q3752984
cites work: Q4113598
cites work: Q5806966
cites work: Generalized convexity and concavity of the optimal value function in nonlinear programming
cites work: An introduction to the theory of nonsmooth optimization
cites work: Partially finite convex programming. II: Explicit lattice models
cites work: Q5589748
cites work: On the continuity of the maximum in parametric linear programming
cites work: The essence of invexity
cites work: Q4133393
cites work: Various definitions of the derivative in mathematical programming
cites work: Calcul sous-différentiel et optimisation
cites work: Stability Theory for Systems of Inequalities. Part I: Linear Systems
cites work: Generalized Directional Derivatives and Subgradients of Nonconvex Functions
cites work: Vector-valued optimization problems in control theory. Transl. from the Russian by John L. Casti
cites work: Q3317047
cites work: A network model for nursing staff scheduling

Characterizing optimality in mathematical programming models (cites work)
cites work: Q4113003

Characterizing optimality in mathematical programming models (cites work)
cites work: Q3348722

Characterizing optimality in mathematical programming models (cites work)
cites work: Constraint qualifications in input optimisation

Characterizing optimality in mathematical programming models (cites work)
cites work: Nonsmooth Calculus in Finite Dimensions

Characterizing optimality in mathematical programming models (cites work)
cites work: Q3706855

Characterizing optimality in mathematical programming models (cites work)
cites work: Q3691566

Characterizing optimality in mathematical programming models (cites work)
cites work: Q3941200

Characterizing optimality in mathematical programming models (cites work)
cites work: Q3342228

Characterizing optimality in mathematical programming models (cites work)
cites work: Input optimization: I. Optimal realizations of mathematical models

Characterizing optimality in mathematical programming models (cites work)
cites work: Characterizing an optimal input in perturbed convex programming

Characterizing optimality in mathematical programming models (cites work)
cites work: Input optimization: III. optimal realizations of multiobjective models

Characterizing optimality in mathematical programming models (cites work)
cites work: Survey of input optimization1

Characterizing optimality in mathematical programming models (cites work)
cites work: Stabilization and determination of the set of minimal binding constraints in convex programming1

Characterizing optimality in mathematical programming models (cites work)
cites work: Q3885537

Characterizing optimality in mathematical programming models (cites work)
cites work: Q3957539

Characterizing optimality in mathematical programming models (cites work)
cites work: Q3801358

Characterizing optimality in mathematical programming models (cites work)
cites work: Q4105489