On optimality and duality for generalized nondifferentiable fractional optimization problems
Commun. Korean Math. Soc. 2010 Vol. 25, No. 1, 139-147
https://doi.org/10.4134/CKMS.2010.25.1.139
Printed March 1, 2010
Moon Hee Kim and Gwi Soo Kim
Tongmyong University and Pukyong National University
Abstract : A generalized nondifferentiable fractional optimization problem (GFP), which consists of a maximum objective function defined by finite fractional functions with differentiable functions and support functions, and a constraint set defined by differentiable functions, is considered. Recently, Kim et al. [Journal of Optimization Theory and Applications $\bf 129$ (2006), no. 1, 131--146] proved optimality theorems and duality theorems for a nondifferentiable multiobjective fractional programming problem (MFP), which consists of a vector-valued function whose components are fractional functions with differentiable functions and support functions, and a constraint set defined by differentiable functions. In fact if $\bar x$ is a solution of (GFP), then $\bar x$ is a weakly efficient solution of (MFP), but the converse may not be true. So, it seems to be not trivial that we apply the approach of Kim et al. to (GFP). However, modifying their approach, we obtain optimality conditions and duality results for (GFP).
Keywords : fractional optimization problem, weakly efficient solution, optimality condition, duality
MSC numbers : Primary 90C26, 90C30, 90C46
Downloads: Full-text PDF  


Copyright © Korean Mathematical Society.
The Korea Science Technology Center (Rm. 411), 22, Teheran-ro 7-gil, Gangnam-gu, Seoul 06130, Korea
Tel: 82-2-565-0361  | Fax: 82-2-565-0364  | E-mail: paper@kms.or.kr   | Powered by INFOrang Co., Ltd