Optimality conditions for optimistic bilevel programming problem using convexifactors (Q415386)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimality conditions for optimistic bilevel programming problem using convexifactors |
scientific article; zbMATH DE number 6031736
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimality conditions for optimistic bilevel programming problem using convexifactors |
scientific article; zbMATH DE number 6031736 |
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
0 references
0 references
0.920423686504364
0 references
0.8668118119239807
0 references
0.852797269821167
0 references
0.8490280508995056
0 references
0.8459246754646301
0 references
