Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/23433
Title: Higher-order generalized convexity and duality in nondifferentiable multiobjective mathematical programming
Authors: Yang, XM
Teo, KL
Yang, XQ 
Issue Date: 2004
Publisher: Academic Press
Source: Journal of mathematical analysis and applications, 2004, v. 297, no. 1, p. 48-55 How to cite?
Journal: Journal of mathematical analysis and applications 
Abstract: In this paper, a class of generalized convexity is introduced and a unified higher-order dual model for nondifferentiable multiobjective programs is described, where every component of the objective function contains a term involving the support function of a compact convex set. Weak duality theorems are established under generalized convexity conditions. The well-known case of the support function in the form of square root of a positive semidefinite quadratic form and other special cases can be readily derived from our results.
URI: http://hdl.handle.net/10397/23433
ISSN: 0022-247X
EISSN: 1096-0813
DOI: 10.1016/j.jmaa.2004.03.036
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

32
Last Week
1
Last month
Citations as of Sep 17, 2017

WEB OF SCIENCETM
Citations

28
Last Week
1
Last month
0
Citations as of Sep 20, 2017

Page view(s)

39
Last Week
1
Last month
Checked on Sep 18, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.