Nonsmooth multiobjective fractional programming with generalized convexity
No Thumbnail Available
Date
Advisors
Evaluators
Journal Title
Journal ISSN
Volume Title
Publisher
Universidad Industrial de Santander
Abstract
Description
En el artículo estudiamos una clase de problemas fraccionales multiobjetivos no convexos y no diferenciables. Usamos la transformación propuesta por Dinkelbach [2] y Jagannathan [4] y obtenemos condiciones de optimalidad para soluciones débilmente eficientes de dichos problemas. Además, definimos un problema dual y establecemos algunos resultados sobre dualidad. Para lograrlo, utilizamos una noción de convexidad generalizada llamada KT-invexidad. El artículo generaliza los resultados obtenidos por Osuna-Gómez et al. en [6], en donde los autores consideran problemas
In this paper we study a class of nonconvex and nondifferentiable multiobjective fractional problems. We use the transformation proposed by Dinkelbach [2] and Jagannathan [4] and we obtain optimality conditions for weakly efficient solutions for these problems. Furthermore, we define a dual problem and we establish some results on duality. To obtain our results, we use a notion of generalized convexity, called KT-invexity. Our paper generalizes the results given by Osuna-Gómez et al. in [6], where the authors considered smooth problems.
In this paper we study a class of nonconvex and nondifferentiable multiobjective fractional problems. We use the transformation proposed by Dinkelbach [2] and Jagannathan [4] and we obtain optimality conditions for weakly efficient solutions for these problems. Furthermore, we define a dual problem and we establish some results on duality. To obtain our results, we use a notion of generalized convexity, called KT-invexity. Our paper generalizes the results given by Osuna-Gómez et al. in [6], where the authors considered smooth problems.
Keywords
Vector fractional programming, Clarke generalized gradient, duality, weak efficiency, optimality conditions