Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions
We apply the quadratic penalization technique to derive strong Lagrangian duality property for an inequality constrained invex program. Our results extend and improve the corresponding results in the literature.
Main Authors: | J. Zhang, X. X. Huang |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2010-01-01
|
Series: | Journal of Inequalities and Applications |
Online Access: | http://dx.doi.org/10.1155/2010/931590 |
Similar Items
-
Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions
by: Huang XX, et al.
Published: (2010-01-01) -
Modified Courant-Beltrami penalty function and a duality gap for invex optimization problem
by: Hassan Mansur, et al.
Published: (2019-01-01) -
Optimality conditions and duality in multiobjective programming with invexity
by: Ferrara Massimiliano, et al.
Published: (2008-01-01) -
Sufficiency and Duality for Multiobjective Programming under New Invexity
by: Yingchun Zheng, et al.
Published: (2016-01-01) -
Duality of (h,φ)-Multiobjective Programming Involving Generalized Invex Functions
by: GuoLin Yu
Published: (2012-01-01)