Second order duality for multiobjective programming with cone constraints

We focus on second order duality for a class of multiobjective programming problem subject to cone constraints. Four types of second order duality models are formulated. Weak and strong duality theorems are established in terms of the generalized convexity, respectively. Converse duality theorems, e...

Full description

Saved in:
Bibliographic Details
Published inScience China. Mathematics Vol. 59; no. 7; pp. 1285 - 1306
Main Authors Tang, LiPing, Yan, Hong, Yang, XinMin
Format Journal Article
LanguageEnglish
Published Beijing Science China Press 01.07.2016
Subjects
Applications of Mathematics
Convexity
Duality theorem
Mathematical models
Mathematical programming
Mathematics
Mathematics and Statistics
Multiple objective
multiobjective programming
cone constraints
90C30
90C46
second order duality
90C29
90C26
Online AccessGet full text

Cover

More Information
Summary:We focus on second order duality for a class of multiobjective programming problem subject to cone constraints. Four types of second order duality models are formulated. Weak and strong duality theorems are established in terms of the generalized convexity, respectively. Converse duality theorems, essential parts of duality theory, are presented under appropriate assumptions. Moreover, some deficiencies in the work of Ahmad and Agarwal (2010) are discussed.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1674-7283
1869-1862
DOI:10.1007/s11425-016-5147-0