Duality for generalized convex multiobjective programming without a constraint qualification

Duality for generalized convex multiobjective programming without a constraint qualification

0.00 Avg rating0 Votes
Article ID: iaor19941611
Country: India
Volume: 30
Issue: 4
Start Page Number: 336
End Page Number: 343
Publication Date: Dec 1993
Journal: OPSEARCH
Authors: ,
Keywords: programming: multiple criteria
Abstract:

The authors establish weak and strong duality relations for a pair of multiobjective nonlinear programming problem without a constraint qualification. These results are extensions in the context of multiobjective programming of some earlier results given by Weir and Mond on generalized convex programming.

Reviews

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