BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf7a7187369
DTSTART;TZID=America/Toronto:20250120T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250120T143000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/co-reading-g
 roup-noah-weninger-1
SUMMARY:C&O Reading Group -Noah Weninger
CLASS:PUBLIC
DESCRIPTION:TITLE: Complexity in linear multilevel programming\n\nSPEAKER:\
 n Noah Weninger\n\nAFFILIATION:\n University of Waterloo\n\nLOCATION:\n MC
  6029\n\nABSTRACT:Bilevel linear programming (BLP) is a generalization of\
 nlinear programming (LP) in which a subset of the variables is\nconstraine
 d to be optimal for a second LP\, called the lower-level\nproblem. Multile
 vel linear programming (MLP) extends this further by\nreplacing the lower-
 level LP with a BLP or even another MLP\, up to\nsome finite number of lev
 els. MLP can be seen as a game-theoretic\nextension of LP where multiple d
 ecision makers with competing\ninterests each have control over some subse
 t of the variables in the\nproblem. We discuss the computational complexit
 y of solving MLP\nproblems\, including some recent results on the complexi
 ty of\ndetermining whether MLPs are unbounded (Rodrigues\, Carvalho\, and 
 Anjos\n2024). We will end with an interesting open problem about the\ncomp
 lexity of determining unboundedness for a\nspecial case of BLP.
DTSTAMP:20260403T082937Z
END:VEVENT
END:VCALENDAR