Duality of Fractional Minimax Programming with Generalized Convex Functions
No Thumbnail Available
Date
1997-07-??
Journal Title
Journal ISSN
Volume Title
Publisher
國立僑生大學先修班
Abstract
Sufficient Kuhn-Tucker conditions for a class of generalized minimax fractional programming and three duility theorems are established under a general type of n-invexity assumption on the objective functions and constraint functions.