\(\epsilon\)-duality theorem of nondifferentiable nonconvex multiobjective programming

DOI10.1007/BF00940327zbMath0800.90735MaRDI QIDQ1321240

Pierre Loridan

Publication date: 27 April 1994

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

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonsmooth analysis (49J52)

Related Items (6)

On approximate efficiency in multiobjective programming ⋮ APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING ⋮ Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization ⋮ Characterizing ϵ-properly efficient solutions ⋮ Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization ⋮ ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps

Cites Work

• \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
• Necessary conditions for ε-optimality
• Penalty functions in ε-programming and ε-minimax problems

This page was built for publication: \(\epsilon\)-duality theorem of nondifferentiable nonconvex multiobjective programming