Nondifferentiable Minimax Fractional Programming Problems with (C, α, ρ, d)-Convexity |
| |
| Authors: | D H Yuan X L Liu A Chinchuluun Graduate Student P M Pardalos |
| |
| Institution: | (1) Department of Mathematics and Computer Science, Hanshan Teachers College, Chaozhou, Guangdong Province, China;(2) Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida, USA;(3) Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida, USA |
| |
| Abstract: | In this paper, we present necessary optimality conditions for nondifferentiable minimax fractional programming problems. A
new concept of generalized convexity, called (C, α, ρ, d)-convexity, is introduced. We establish also sufficient optimality conditions for nondifferentiable minimax fractional programming
problems from the viewpoint of the new generalized convexity. When the sufficient conditions are utilized, the corresponding
duality theorems are derived for two types of dual programs.
This research was partially supported by NSF and Air Force grants |
| |
| Keywords: | Minimax fractional programming problem (C α ρ d)-convexity necessary conditions sufficient conditions duality theory |
| 本文献已被 SpringerLink 等数据库收录！ |
|
