Duality in nonconvex multiobjective programming

Duality in nonconvex multiobjective programming

0.00 Avg rating0 Votes
Article ID: iaor19941937
Country: Singapore
Volume: 8
Issue: 1
Start Page Number: 62
End Page Number: 69
Publication Date: May 1991
Journal: Asia-Pacific Journal of Operational Research
Authors: ,
Keywords: duality
Abstract:

A multiobjective programming problem is considered. Strong and converse duality theorems are established using Karush-Kuhn-Tucker and Fritz John type necessary conditions respectively. An application to a multiobjective fractional programming is discussed. These results subsume the duality theorems of vector et al.

Reviews

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