Preinvex functions and weak efficient solutions for some vectorial optimization problem in Banach spaces
From MaRDI portal
Publication:1770662
DOI10.1016/j.camwa.2003.05.013zbMath1095.90105MaRDI QIDQ1770662
Marko A. Rojas-Medar, Rafaela Osuna-Gómez, Antonio Rufián-Lizana, Lucelina Batista Dos Santos
Publication date: 7 April 2005
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2003.05.013
90C29: Multi-objective and goal programming
90C46: Optimality conditions and duality in mathematical programming
26B25: Convexity of real functions of several variables, generalizations
Related Items
Existence of weakly efficient solutions in nonsmooth vector optimization, The gap function for optimization problems in Banach spaces, Existence of weakly efficient solutions in vector optimization, Some vector optimization problems in Banach spaces with generalized convexity, Multi-objective infinite programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On sufficiency of the Kuhn-Tucker conditions
- Weak Pareto-optimal necessary conditions in a nondifferentiable multiobjective program on a Banach space
- Invex functions and generalized convexity in multiobjective programming
- Invexity and the Kuhn-Tucker theorem
- Multiobjective fractional programming with generalized convexity
- Optimality conditions for Pareto nonsmooth nonconvex programming in Banach spaces
- Lectures on mathematical theory of extremum problems. Translated from the Russian by D. Louvish
- Convex Transformable Programming Problems and Invexity
- Nonsmooth multiobjective programming
- Optimality conditions for multiobjecttve and nonsmooth minimisation in abstract spaces
- Lagrange multiplers for pareto nonsmooth programming problems in banach spaces
- On generalised convex multi-objective nonsmooth programming
- Generalized convexity in multiobjective programming
