Saddle point and generalized convex duality for multiobjective programming.

DOI10.1007/BF02935757zbMath1141.90535MaRDI QIDQ1880483

Zhaoxiang Yan, Shizheng Li

Publication date: 28 September 2004

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

zbMATH Keywords

saddle pointconstraint qualificationefficient solutionsublinear function

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29)

Related Items (2)

Generalized Lagrange function and generalized weak saddle points for a class of multiobjective fractional optimal control problems ⋮ Saddle point criteria and Wolfe duality in nonsmooth (Φ, ρ)-invex vector optimization problems with inequality and equality constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficiency and generalized convex duality for multiobjective programs
• A duality theorem for non-linear programming
• Further Generalizations of Convexity in Mathematical Programming

This page was built for publication: Saddle point and generalized convex duality for multiobjective programming.