Duality in nondifferentiable vector programming

DOI10.1006/jmaa.2000.7417zbMath1039.90068OpenAlexW2069175420MaRDI QIDQ5945939

Rafaela Osuna-Gómez, Antonio Rufián-Lizana, Pascual Ruíz-Canales

Publication date: 2001

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jmaa.2000.7417

zbMATH Keywords

efficiency conditionsLagrange dualitysaddle point conditions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30)

Related Items (6)

Duality and saddle-points for convex-like vector optimization problems on real linear spaces ⋮ Integral Global Optimality Conditions and an Algorithm for Multiobjective Problems ⋮ New optimality conditions for nonsmooth control problems ⋮ Duality and saddle-point type optimality for generalized nonlinear fractional programming. ⋮ Vector continuous-time programming without differentiability ⋮ Higher-order optimality conditions in set-valued optimization using Studniarski derivatives and applications to duality

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On duality theory in multiobjective programming
• Pre-invex functions in multiple objective optimization
• Duality for nonlinear multiple-criteria optimization problems
• Duality theory for maximizations with respect to cones
• On efficiency and duality for multiobjective programs
• \(D\)-invexity and optimality conditions
• Alternative theorems and optimality conditions with weakened convexity
• Duality theory in multiobjective programming
• A characterization of weakly efficient points
• Duality for nonlinear multiobjective programs: A linearization approach
• Proper efficiency and the theory of vector maximization
• Vector maximisation and lagrange multipliers
• Duality with generalized convexity

This page was built for publication: Duality in nondifferentiable vector programming