BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Jesús A. De Loera (UC Davis)
DTSTART:20210527T153000Z
DTEND:20210527T160000Z
DTSTAMP:20260418T105713Z
UID:MIP2021/38
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/MIP2021/38/"
 >Extreme behavior in linear programs and the simplex method</a>\nby Jesús
  A. De Loera (UC Davis) as part of Mixed Integer Programming Workshop 2021
 \n\n\nAbstract\nLinear programs and the simplex method are at the core of 
 mathematical optimization\, both in theory and in practice. \nToday plenty
  of fascinating open questions remain about the behavior of the simplex me
 thod.\n\nIn this lecture we introduce natural geometric-topological struct
 ure one can associate to the set of all possible monotone paths of a linea
 r program. Using this structure we are interested to find the extreme beha
 vior of LPs regarding the following questions: a) How long can the  monoto
 ne paths on a linear program be?  b) How many different monotone paths can
  there be on a linear program?\n\nWe report on some highlights from three 
 recent papers\, the first joint work with Moise Blanchard (MIT) and Quenti
 n Louveaux (U. Liege)\, the second with Sean Kafer (U. Waterloo) and Laura
  Sanità (TU Eindhoven) and the third with Christos Athanasiadis (U. Athen
 s) and Zhenyang Zhang (U. California\, Davis).\nPapers are available at an
 d https://arxiv.org/abs/2002.00999\, https://arxiv.org/abs/1909.12863 and 
 https://arxiv.org/abs/2001.09575\n
LOCATION:https://researchseminars.org/talk/MIP2021/38/
END:VEVENT
END:VCALENDAR