BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Understanding linear programming and the simplex algorithm - Gil K
 alai (Yale)
DTSTART:20240415T120000Z
DTEND:20240415T130000Z
UID:TALK224971@talks.cam.ac.uk
CONTACT:Tom Gur
DESCRIPTION:Linear programming is the problem of maximizing a linear funct
 ion φ subject to a system of linear inequalities. The solutions to these 
 linear inequalities form a convex polyhedron P and Dantzig's simplex algor
 ithm from the early 50s\, can be described geometrically as moving from on
 e vertex to an adjacent vertex of P. I will  overview some developments re
 garding linear programming and the simplex algorithms and present some out
 standing problems. The first is bounding from above the diameter of graphs
  of polytopes and the second is finding pivot rules to the simplex algorit
 hm that require a small number of steps. 
LOCATION:Computer Laboratory\, William Gates Building\, LT1
END:VEVENT
END:VCALENDAR