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