Duality theorem of nondifferentiable convex multiobjective programming

DOI10.1007/BF00938628zbMath0577.90077OpenAlexW2083034794MaRDI QIDQ1065718

B. George

Publication date: 1986

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00938628

zbMATH Keywords

optimality conditionsdualitymultiobjective programmingPareto optimalitygeneralized saddle pointnonlinear nondifferentiable convex multiobjective minimization

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Duality theory (optimization) (49N15) Methods of successive quadratic programming type (90C55) Optimality conditions for free problems in two or more independent variables (49K10)

Related Items (14)

New optimality conditions for a nondifferentiable fractional semipreinvex programming problem ⋮ An N-person non-cooperative discounted vector-valued dynamic game with a metric space ⋮ Moreau-Rockafellar type theorem for convex set functions ⋮ On a D-solution of a cooperative m-person discounted Markov game ⋮ Optimality for set functions with values in ordered vector spaces ⋮ Axiomatic approach to duality in optimization ⋮ On sufficiency and duration in nonsmooth multiobjective programming. ⋮ Duality for nonsmooth multiobjective fractional programs under generalized \((F,\rho)\)-convexity. ⋮ Multiplier rules for weak pareto optimization problems ⋮ Vector saddle-point and distributed parameter differential games ⋮ Duality for a minimax programming problem containing \(n\)-set functions ⋮ On multiobjective nonlinear programming with support 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

Cites Work

• Unnamed Item
• Unnamed Item
• More on subgradient duality
• Weak Pareto optimality of multiobjective problems in a locally convex linear topological space
• Necessary conditions for optimality of nondifferentiable convex multiobjective programming
• Some minimax theorems in vector-valued functions
• Pareto optimality in multiobjective problems
• A subgradient duality theorem
• Duality theory in multiobjective programming
• A duality theorem for non-linear programming
• Duality in vector optimization

This page was built for publication: Duality theorem of nondifferentiable convex multiobjective programming