Sufficiency and Duality for Multiobjective Programming under New Invexity

Yingchun Zheng and Xiaoyan Gao

Mathematical Problems in Engineering, 2016, vol. 2016, 1-14

Abstract:

A class of multiobjective programming problems including inequality constraints is considered. To this aim, some new concepts of generalized -type I and -type II functions are introduced in the differentiable assumption by using the sublinear function . These new functions are used to establish and prove the sufficient optimality conditions for weak efficiency or efficiency of the multiobjective programming problems. Moreover, two kinds of dual models are formulated. The weak dual, strong dual, and strict converse dual results are obtained under the aforesaid functions.

Date: 2016
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2016/8462602.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2016/8462602.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:8462602

DOI: 10.1155/2016/8462602

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().