Please use this identifier to cite or link to this item:
|Title:||Duality of Fractional Minimax Programming with Generalized Convex Functions|
|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.|
|Appears in Collections:||國立僑生大學先修班學報|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.