BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//ALOP - ECPv6.17.4.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:ALOP
X-ORIGINAL-URL:https://alop.uni-trier.de
X-WR-CALDESC:Events for ALOP
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Berlin
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20210328T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20211031T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20220327T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20221030T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20230326T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20231029T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20220207T160000
DTEND;TZID=Europe/Berlin:20220207T170000
DTSTAMP:20220110T113307Z
CREATED:20211102T120107Z
LAST-MODIFIED:20220110T113307Z
UID:6260-1644249600-1644253200@alop.uni-trier.de
SUMMARY:ALOP-Colloquium with Prof. Geunyeong Byeon\, Arizona State University
DESCRIPTION:On Monday\, February 7\, 2022\, at 16:00 c.t.\, Prof. Geunyeong Byeon\, Arizona State University will speak about her recent work. \nDecomposition Methods for Bilevel Problems with Convex Follower \nAbstract: Bilevel optimization formulates hierarchical decision-making processes that arise in many real-world applications such as in pricing\, network design\, and infrastructure defense planning. This work considers a class of bilevel optimization problems where the upper level problem features some integer variables while the lower level problem enjoys strong duality. We propose a dedicated Benders decomposition method for solving this class of bilevel problems\, which decomposes the Benders subproblem into two more tractable\, sequentially solvable problems that can be interpreted as the upper and the lower level problems. We show that the Benders subproblem decomposition carries over to an interesting extension of bilevel problems\, which connects the upper level solution with the lower level dual solution\, and discuss some special cases of bilevel problems that allow sequence-independent subproblem decomposition. Several novel schemes for generating numerically stable cuts\, finding a good incumbent solution\, and accelerating the search tree are discussed. A computational study demonstrates the computational benefits of the proposed method over a state-of-the-art bilevel-tailored branch-and-cut method\, a commercial solver\, and the standard Benders method on standard test cases and the motivating applications in sequential energy markets. \nThis presentation will take place via ZOOM. A link will be e-mailed prior to the event
URL:https://alop.uni-trier.de/event/alop-colloquium-with-prof-geunyeong-byeon-arizona-state-university/
CATEGORIES:Colloquium
ORGANIZER;CN="RTG ALOP at Trier University":MAILTO:ALOP@uni-trier.de
END:VEVENT
END:VCALENDAR