Abstract
A Mond-Weir type dual is formulated for a multiobjective fractional programming problem and duality theorems are established that relate to efficient solutions of the primal and dual problems. The strong and converse duality theorems are proved using Fritz John type necessary conditions, which avoid the need of a constrain qualification.
| Original language | English |
|---|---|
| Pages (from-to) | 63-74 |
| Number of pages | 12 |
| Journal | Asia-Pacific Journal of Operational Research |
| Volume | 15 |
| Issue number | 1 |
| State | Published - 1998 |
| Externally published | Yes |
Keywords
- Duality
- Efficiency
- Fractional programming
- Generalized convexity
- Multiobjective programming
ASJC Scopus subject areas
- Management Science and Operations Research
Fingerprint
Dive into the research topics of 'Multiobjective duality using Fritz John conditions'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver