BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Computational Optimisation Group - ECPv6.15.11//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Computational Optimisation Group
X-ORIGINAL-URL:http://optimisation.doc.ic.ac.uk
X-WR-CALDESC:Events for Computational Optimisation Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20110101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20121129T150000
DTEND;TZID=UTC:20121129T150000
DTSTAMP:20260418T123447
CREATED:20170124T102145Z
LAST-MODIFIED:20170124T102145Z
UID:591-1354201200-1354201200@optimisation.doc.ic.ac.uk
SUMMARY:Seminar: The Branch-and-Sandwich Algorithm for Mixed-Integer Nonlinear Bilevel Programming Problems
DESCRIPTION:Title: The Branch-and-Sandwich Algorithm for Mixed-Integer Nonlinear Bilevel Programming ProblemsSpeaker: Dr. Polyxeni-Margarita KleniatiAffiliation: Centre for Process Systems Engineering at Imperial College LondonLocation: Room 144 HuxleyTime: 3:00pm \nAbstract. We extend our recently introduced algorithm for general bilevel programming problems\, Branch-and-Sandwich (Kleniati and Adjiman\, J. Global Optim.\, 2012)\, to the class of mixed-integer nonlinear bilevel problems.  As in the original algorithm\, auxiliary inner lower and upper bounding problems are constructed in order to bound the inner value function and provide constant bound cuts for the outer upper and outer lower bounding problems. The KKT-based relaxations\, originally proposed for the inner upper bounding and the outer lower bounding problems\, are applicable with respect to the lower-level continuous variables based on appropriate constraint qualifications\, but are no longer required. In the extension that we present here\, a robust counterpart approach is employed to formulate the inner upper bounding problem and the resulting bound cut may be the only constraint added to the proposed outer lower bounding problem. The branching framework with auxiliary lists of nodes\, as developed for the original Branch-and-Sandwich\, is also applied to the discrete case. The algorithm is used to solve successfully ten literature problems. \nAbout the speaker. Dr. Kleniati is undertaking her second postdoctoral research position with Prof. Adjiman at the Chemical Engineering department of Imperial College London. She received her PhD in Computing and Optimisation research in 2010 under the supervision of Prof. Rustem at the department of Computing in Imperial College London.  The research of Polyxeni Kleniati is currently focused on the global optimisation of bilevel programming problems with applications to chemical engineering.
URL:http://optimisation.doc.ic.ac.uk/event/seminar-the-branch-and-sandwich-algorithm-for-mixed-integer-nonlinear-bilevel-programming-problems/
END:VEVENT
END:VCALENDAR