Optimality conditions for optimistic bilevel programming problem using convexifactors (Q415386): 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.1007/s10957-011-9941-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2053072311 / rank | |||
Normal rank | |||
Revision as of 23:01, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimality conditions for optimistic bilevel programming problem using convexifactors |
scientific article |
Statements
Optimality conditions for optimistic bilevel programming problem using convexifactors (English)
0 references
8 May 2012
0 references
A bilevel mathematical programming problem is considered with a convex lower-level problem. New Karush-Kuhn-Tucker type necessary optimality conditions are established. The proof is based on the concept of convexification, and on an upper estimate of the Clark subdifferential of the value function.
0 references
bilevel programming
0 references
convexification
0 references
constraint qualification
0 references
