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

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

0.00 Avg rating0 Votes
Article ID: iaor20083404
Country: Netherlands
Volume: 154
Issue: 1
Start Page Number: 133
End Page Number: 147
Publication Date: Oct 2007
Journal: Annals of Operations Research
Authors: , ,
Keywords: decision theory: multiple criteria
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.

Reviews

Required fields are marked *. Your email address will not be published.