Duality of Fractional Minimax Programming with Generalized Convex Functions

dc.contributor.author吳春盛zh_tw
dc.contributor.authorC.S. Wuen_US
dc.date.accessioned2016-04-28T02:30:53Z
dc.date.available2016-04-28T02:30:53Z
dc.date.issued1997-07-??
dc.description.abstractSufficient 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.en_US
dc.identifier66149A4F-5C4F-B1AE-B86E-DBAAEFF4EDD0
dc.identifier.urihttp://rportal.lib.ntnu.edu.tw/handle/20.500.12235/77716
dc.language英文
dc.publisher國立僑生大學先修班zh_tw
dc.relation5,297-314
dc.relation.ispartof國立僑生大學先修班學報zh_tw
dc.titleDuality of Fractional Minimax Programming with Generalized Convex Functionszh-tw

Files