Show simple item record

dc.contributor.authorYang, Xinmin
dc.contributor.authorYang, Jin
dc.contributor.authorYip, Tsz Leung
dc.contributor.authorTeo, Kok Lay
dc.date.accessioned2017-01-30T11:07:50Z
dc.date.available2017-01-30T11:07:50Z
dc.date.created2014-03-10T20:00:43Z
dc.date.issued2013
dc.identifier.citationYang, Xinmin and Yang, Jin and Yip, Tsz Leung and Teo, Kok Lay. 2013. Higher-order Mond-Weir converse duality in multiobjective programming involving cones. Science China: Mathematics. 56 (11): pp. 2389-2392.
dc.identifier.urihttp://hdl.handle.net/20.500.11937/8637
dc.identifier.doi10.1007/s11425-013-4700-3
dc.description.abstract

In this work, we established a converse duality theorem for higher-order Mond-Weir type multiobjective programming involving cones. This fills some gap in recently work of Kim et al. [Kim D S, Kang H S, Lee Y J, et al. Higher order duality in multiobjective programming with cone constraints. Optimization, 2010, 59: 29–43].

dc.publisherZhongguo Kexue Zazhishe
dc.subjectconverse duality theorem
dc.subjecthigher order Mond-Weir dual model
dc.subjectmultiobjective programming
dc.subjectcones
dc.titleHigher-order Mond-Weir converse duality in multiobjective programming involving cones
dc.typeJournal Article
dcterms.source.volume56
dcterms.source.startPage2389
dcterms.source.endPage2392
dcterms.source.issn1674-7283
dcterms.source.titleScience China: Mathematics
curtin.department
curtin.accessStatusFulltext not available


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record