Generalized minimax programming with nondifferentiable \((G, \beta)\)-invexity (Q2375696): 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/2013/854125 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2029459225 / rank | |||
Normal rank | |||
Revision as of 03:15, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generalized minimax programming with nondifferentiable \((G, \beta)\)-invexity |
scientific article |
Statements
Generalized minimax programming with nondifferentiable \((G, \beta)\)-invexity (English)
0 references
14 June 2013
0 references
Summary: We consider the generalized minimax programming problem (P) in which functions are locally Lipschitz \((G, \beta)\)-invex. Not only \(G\)-sufficient but also \(G\)-necessary optimality conditions are established for problem (P). With \(G\)-necessary optimality conditions and \((G, \beta)\)-invexity on hand, we construct dual problem (DI) for the primal one (P) and prove duality results between problems (P) and (DI). These results extend several known results to a wider class of programs.
0 references
