Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity

Altannar Chinchuluun (), Dehui Yuan () and Panos Pardalos ()

Annals of Operations Research, 2007, vol. 154, issue 1, 133-147

Abstract: In this paper, we consider nondifferentiable multiobjective fractional programming problems. A concept of generalized convexity, which is called (C,α,ρ,d)-convexity, is first discussed. Based on this generalized convexity, we obtain efficiency conditions for multiobjective fractional programming (MFP). Furthermore, we establish duality results for three types of dual problems of (MFP) and present the corresponding duality theorems. Copyright Springer Science+Business Media, LLC 2007

Keywords: Multiobjective fractional programming problem; (C; α; ρ; d)-convexity; Efficiency conditions; Global efficient solution; Duality (search for similar items in EconPapers)
Date: 2007
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-007-0180-6 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:154:y:2007:i:1:p:133-147:10.1007/s10479-007-0180-6

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-007-0180-6

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().