Bilevel programs with extremal value function: global optimality
release_qhhwthp66bcxnmy4eznkaizdsy
by
Abdelmalek Aboussoror, Hicham Babahadda, Abdelatif Mansouri
2005 Volume 2005, p419-435
Abstract
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<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="$Max$" id="E1"><mml:mtext>max</mml:mtext></mml:math>-<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="$Min$" id="E2"><mml:mtext>min</mml:mtext></mml:math>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.
In application/xml+jats
format
Archived Files and Locations
application/pdf 191.7 kB
file_c3zhpwuou5bs5ijombcb3pwpcq
|
web.archive.org (webarchive) web.archive.org (webarchive) www.emis.de (web) |
application/pdf 198.7 kB
file_yu75njx5gzes3ivzi6pw7yhmbq
|
web.archive.org (webarchive) emis.maths.adelaide.edu.au (web) web.archive.org (webarchive) web.archive.org (webarchive) web.archive.org (webarchive) + 1 more URLs |
application/pdf 200.7 kB
file_7xfp62xv7nekbk7jq7cvy7texy
|
emis.maths.tcd.ie (web) web.archive.org (webarchive) web.archive.org (webarchive) www.maths.soton.ac.uk (web) web.archive.org (webarchive) + 1 more URLs |
application/pdf 2.0 MB
file_6ofn4g2l3zcb3clgtx2xdnrtxa
|
downloads.hindawi.com (publisher) web.archive.org (webarchive) |
access all versions, variants, and formats of this works (eg, pre-prints)
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar