Bilevel programs with extremal value function: global optimality (Q2566594): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2005791695 / rank | |||
Normal rank |
Latest revision as of 09:16, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bilevel programs with extremal value function: global optimality |
scientific article |
Statements
Bilevel programs with extremal value function: global optimality (English)
0 references
26 September 2005
0 references
Summary: For a bilevel program with extremal value function, a necessary and sufficient condition for global optimality is given, which reduces the bilevel program to a max-min problem with linked constraints. Also, for the case where the extremal value function is polyhedral, this optimality condition gives the possibility of a resolution via a maximization problem of a polyhedral convex function over a convex set. Finally, this case is completed by an algorithm.
0 references