A characterization of pseudoinvexity in multiobjective programming

DOI10.1016/j.mcm.2008.05.054zbMath1187.90246OpenAlexW1997616845MaRDI QIDQ2389834

Gabriel Ruiz-Garzón, Manuel Arana-Jiménez, Antonio Rufián-Lizana, Rafaela Osuna-Gómez

Publication date: 19 July 2009

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2008.05.054

zbMATH Keywords

multiobjective programminginvexityefficient solutionweakly efficient solutionpseudoinvexityvector critical point

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Functions of several variables (26B99)

Related Items

Some relations between minty variational-like inequality problems and vectorial optimization problems in Banach spaces ⋮ Duality and a characterization of pseudoinvexity for Pareto and weak Pareto solutions in nondifferentiable multiobjective programming ⋮ A reduced formulation for pseudoinvex vector functions ⋮ Vector critical points and cone efficiency in nonsmooth vector optimization ⋮ Generalized convexity in fuzzy vector optimization through a linear ordering ⋮ A characterization of pseudoinvexity for the efficiency in non-differentiable multiobjective problems. Duality ⋮ Vector critical points and efficiency in vector optimization with Lipschitz functions

Cites Work

• Unnamed Item
• On sufficiency of the Kuhn-Tucker conditions
• Necessary conditions for optimality of nondifferentiable convex multiobjective programming
• Invex functions and generalized convexity in multiobjective programming
• Optimality criteria and duality in multiple-objective optimization involving generalized invexity
• What is invexity?
• Invex functions and constrained local minima
• Lagrangean conditions and quasiduality
• Generalized convexity in multiobjective programming
• Multiobjective programming under generalized type I invexity