Duality theorem of nondifferentiable convex multiobjective programming
From MaRDI portal
Publication:1065718
DOI10.1007/BF00938628zbMath0577.90077MaRDI QIDQ1065718
Publication date: 1986
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
optimality conditions; duality; multiobjective programming; Pareto optimality; generalized saddle point; nonlinear nondifferentiable convex multiobjective minimization
90C25: Convex programming
90C31: Sensitivity, stability, parametric optimization
49N15: Duality theory (optimization)
90C55: Methods of successive quadratic programming type
49K10: Optimality conditions for free problems in two or more independent variables
Related Items
Duality for a minimax programming problem containing \(n\)-set functions, Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces, Optimality conditions and duality in subdifferentiable multiobjective fractional programming, Multiplier rules for weak pareto optimization problems, Axiomatic approach to duality in optimization