Abstract
In the present paper, we establish sufficient optimality conditions for a minimax fractional programming problem under the assumptions of (Phi, rho)-invexity. Weak, strong and strict converse duality theorems are also derived for a dual model of minimax fractional programming problem.
| Original language | English |
|---|---|
| Journal | Mathematical Reports |
| State | Published - 2015 |
Fingerprint
Dive into the research topics of 'SUFFICIENCY AND DUALITY IN MINIMAX FRACTIONAL PROGRAMMING WITH GENERALIZED (Phi, rho)-INVEXITY'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver