Strong and total Lagrange dualities for quasiconvex programming (Q2336429): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1155/2014/453912 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2134104994 / rank | |||
Normal rank | |||
Revision as of 18:51, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strong and total Lagrange dualities for quasiconvex programming |
scientific article |
Statements
Strong and total Lagrange dualities for quasiconvex programming (English)
0 references
19 November 2019
0 references
Summary: 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.
0 references
