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
Year of publication: |
2012
|
---|---|
Authors: | Lai, Hang-Chin ; Chen, Hui-Mei |
Published in: |
Journal of Global Optimization. - Springer. - Vol. 54.2012, 2, p. 295-306
|
Publisher: |
Springer |
Subject: | Minimax fractional programming | Weak duality theorem | Strong duality theorem | Strict converse duality theorem |
Saved in:
Saved in favorites
Similar items by person
-
Duality on a nondifferentiable minimax fractional programming
Lai, Hang-Chin, (2012)
-
Nondifferentiable minimax fractional programming in complex spaces with parametric duality
Lai, Hang-Chin, (2012)
-
Chen, Hui-Mei, (2005)
- More ...