Open Access
2014 Strong and Total Lagrange Dualities for Quasiconvex Programming
Donghui Fang, XianFa Luo, Xianyun Wang
J. Appl. Math. 2014: 1-8 (2014). DOI: 10.1155/2014/453912


We consider the strong and total Lagrange dualities for infinite quasiconvex optimization problems. By using the epigraphs of the z-quasi-conjugates and the Greenberg-Pierskalla subdifferential of these functions, we introduce some new constraint qualifications. Under the new constraint qualifications, we provide some necessary and sufficient conditions for infinite quasiconvex optimization problems to have the strong and total Lagrange dualities.


Download Citation

Donghui Fang. XianFa Luo. Xianyun Wang. "Strong and Total Lagrange Dualities for Quasiconvex Programming." J. Appl. Math. 2014 1 - 8, 2014.


Published: 2014
First available in Project Euclid: 2 March 2015

zbMATH: 07131604
MathSciNet: MR3214508
Digital Object Identifier: 10.1155/2014/453912

Rights: Copyright © 2014 Hindawi

Vol.2014 • 2014
Back to Top