On duality theory in multiobjective programming
From MaRDI portal
Publication:1053614
DOI10.1007/BF00935006zbMath0517.90076MaRDI QIDQ1053614
Publication date: 1984
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
duality theory; saddle-point; nonlinear multiobjective programming; vector-valued Lagrangian functions; M-convexity; Slater's constraint qualification; vector-valued conjugate functions
90C30: Nonlinear programming
90C31: Sensitivity, stability, parametric optimization
49M37: Numerical methods based on nonlinear programming
49N15: Duality theory (optimization)
Related Items
Duality in nondifferentiable vector programming, On generalized Fenchel-Moreau theorem and second-order characterization for convex vector functions, On the Fritz John saddle point problem for differentiable multiobjective optimization, Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems, A duality theory for set-valued functions. I: Fenchel conjugation theory, Generalized Motzkin theorems of the alternative and vector optimization problems, Duality related to approximate proper solutions of vector optimization problems, Vector continuous-time programming without differentiability, On \(G\)-invex multiobjective programming. II: Duality, Theorems of the alternative and their applications in multiobjective optimization, About duality and alternative in multi-objective optimization, On two generalizations of Pareto minimality, Duality theory for infinite-dimensional multiobjective linear programming, Continuity properties of cone-convex functions, Approximate saddle-point theorems in vector optimization, A survey of recent developments in multiobjective optimization, Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems, Contingent derivatives of set-valued maps and applications to vector optimization, Convexity of the optimal multifunctions and its consequences in vector optimization, Necessary and sufficient conditions for weak efficiency in non-smooth vectorial optimization problems, Selection of efficient points, Convexity and closedness of sets with respect to cones, On the characterization of efficient points by means of monotone functionals, A saddlepoint theorem for set-valued maps, Axiomatic approach to duality in optimization
Cites Work
