Duality without constraint qualification for multiobjective fractional programming

Duality without constraint qualification for multiobjective fractional programming

0.00 Avg rating0 Votes
Article ID: iaor19931976
Country: Singapore
Volume: 9
Issue: 2
Start Page Number: 195
End Page Number: 206
Publication Date: Nov 1992
Journal: Asia-Pacific Journal of Operational Research
Authors: , ,
Keywords: programming: multiple criteria, lagrange multipliers
Abstract:

Extending earlier duality results for multiobjective programs, this paper defines dual problems for convex/concave multiobjective fractional programs without requiring a constraint qualification. The duals provide multiobjective extensions of the classical duals of Bector and Schaible.

Reviews

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