Abstract
The purpose of this paper is to consider a class of nondifferentiable multiobjective fractional programming problems in which every component of the objective and constraints functions contains a term involving the support function of a compact convex set. Usual duality theorems are established for two types of higher order dual models under the assumptions of higher order (F, α, ρ, d) - V -type I functions.
| Original language | English |
|---|---|
| Pages (from-to) | 1444-1455 |
| Number of pages | 12 |
| Journal | Journal of Computational Analysis and Applications |
| Volume | 15 |
| Issue number | 8 |
| State | Published - 2013 |
Keywords
- Fractional programming
- Generalized convexity
- Higher order duality
- Nondifferentiable programming
- Support function
ASJC Scopus subject areas
- Computational Mathematics
Fingerprint
Dive into the research topics of 'Higher order duality in nondifferentiable fractional programming involving generalized convexity'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver