Strong and Total Lagrange Dualities for Quasiconvex Programming
Joint Authors
Luo, Xianfa
Fang, Donghui
Wang, Xianyun
Source
Journal of Applied Mathematics
Issue
Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-8, 8 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2014-05-22
Country of Publication
Egypt
No. of Pages
8
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Fang, Donghui& Luo, Xianfa& Wang, Xianyun. 2014. Strong and Total Lagrange Dualities for Quasiconvex Programming. Journal of Applied Mathematics،Vol. 2014, no. 2014, pp.1-8.
https://search.emarefa.net/detail/BIM-472836
Modern Language Association (MLA)
Fang, Donghui…[et al.]. Strong and Total Lagrange Dualities for Quasiconvex Programming. Journal of Applied Mathematics No. 2014 (2014), pp.1-8.
https://search.emarefa.net/detail/BIM-472836
American Medical Association (AMA)
Fang, Donghui& Luo, Xianfa& Wang, Xianyun. Strong and Total Lagrange Dualities for Quasiconvex Programming. Journal of Applied Mathematics. 2014. Vol. 2014, no. 2014, pp.1-8.
https://search.emarefa.net/detail/BIM-472836
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-472836
