Duality on a nondifferentiable minimax fractional programming
We establish the necessary and sufficient optimality conditions on a nondifferentiable minimax fractional programming problem. Subsequently, applying the optimality conditions, we constitute two dual models: Mond-Weir type and Wolfe type. On these duality types, we prove three duality theorems—weak duality theorem, strong duality theorem, and strict converse duality theorem. Copyright Springer Science+Business Media, LLC. 2012
Volume (Year): 54 (2012)
Issue (Month): 2 (October)
|Contact details of provider:|| Web page: http://www.springer.com/business/operations+research/journal/10898|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:54:y:2012:i:2:p:295-306. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.