BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
TZID:Europe/Paris
X-WR-TIMEZONE:Europe/Paris
BEGIN:VEVENT
UID:8535@i2m.univ-amu.fr
DTSTART;TZID=Europe/Paris:20241218T103000
DTEND;TZID=Europe/Paris:20241218T120000
DTSTAMP:20250109T131905Z
URL:https://www.i2m.univ-amu.fr/evenements/on-the-number-of-degenerate-sim
 plex-pivots/
SUMMARY:Kirill  Kukharenko (Otto-von-Guericke University Magdeburg): On the
  Number of Degenerate Simplex Pivots
DESCRIPTION:Kirill  Kukharenko: The simplex algorithm is one of the most po
 pular algorithms to solve linear programs (LPs). Starting at an extreme po
 int solution of an LP\, it performs a sequence of basis exchanges (called 
 pivots) that allows one to move to a better extreme point along an improvi
 ng edge-direction of the underlying polyhedron. A key issue in the simplex
  algorithm's performance is degeneracy\, which may lead to a (potentially 
 long) sequence of basis exchanges which do not change the current extreme 
 point solution. We prove that it is always possible to limit the number of
  consecutive degenerate pivots that the simplex algorithm performs to n−
 m−1\, where n is the number of variables and m is the number of equality
  constraints of a given LP in standard equality form. This is a joint work
  with Laura Sanità.
CATEGORIES:Séminaire,Doctorant⋅es de l'I2M
LOCATION:Saint-Charles - FRUMAM  (2ème étage)\, 3 Place Victor Hugo\, Mar
 seille\, 13003\, France
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=3 Place Victor Hugo\, Marse
 ille\, 13003\, France;X-APPLE-RADIUS=100;X-TITLE=Saint-Charles - FRUMAM  (
 2ème étage):geo:0,0
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20241027T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR