Abstract
In this paper, we are concerned with a nondifferentiable minimax fractional programming problem. We derive a Kuhn-Tucker-type sufficient optimality condition for an optimal solution to the problem and establish week, strong and converse duality theorems for the problem and its three different forms of dual problems. The results in this paper extend a few known results in the literature. © 2003 Elsevier B.V. All rights reserved.
| Original language | English |
|---|---|
| Pages (from-to) | 379-395 |
| Journal | Journal of Computational and Applied Mathematics |
| Volume | 158 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 15 Sept 2003 |
Research Keywords
- Duality
- Nondifferentiable minimax fractional problem
- Sufficient conditions
- Univexity
Fingerprint
Dive into the research topics of 'Nondifferentiable minimax fractional programming under generalized univexity'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver