Optimality conditions for optimistic bilevel programming problem using convexifactors (Q415386): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
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. | |||
| Property / review text: 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. / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Antanas Žilinskas / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C26 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C46 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6031736 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
bilevel programming | |||
| Property / zbMATH Keywords: bilevel programming / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
convexification | |||
| Property / zbMATH Keywords: convexification / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
constraint qualification | |||
| Property / zbMATH Keywords: constraint qualification / rank | |||
Normal rank | |||
Revision as of 20:30, 29 June 2023
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
