Strong and Total Lagrange Dualities for Quasiconvex Programming
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 qualificatio...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2014/453912 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|