BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Date iCal//NONSGML kigkonsult.se iCalcreator 2.20.2//
METHOD:PUBLISH
X-WR-CALNAME;VALUE=TEXT:Eventi DIAG
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:STANDARD
DTSTART:20231029T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20240331T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.27378.field_data.0@www.glad.uniroma1.it
DTSTAMP:20260406T193347Z
CREATED:20231115T143836Z
DESCRIPTION:Abstract: LP duality (the strong duality theorem of linear prog
 ramming) and the minimax theorem for zero-sum games are considered 'equiva
 lent' in the sense that one can easily be proved from the other. However\,
  the classic proof by Dantzig (1951) of LP duality from the minimax theore
 m is flawed. It needs an additional assumption of strict complementarity. 
 We show that this assumption amounts to assuming the Lemma of Farkas\, whi
 ch proves LP duality directly. We fix this with a new\, different proof vi
 a the Theorems of Gordan (1873) and Tucker (1956)\, distilled from Adler (
 2013). We also describe some lesser known beautiful existing direct proofs
  of the minimax theorem and the Lemma of Farkas. This is a mostly exposito
 ry talk on a rather general but fundamental topic and is not too technical
 .
DTSTART;TZID=Europe/Paris:20231123T160000
DTEND;TZID=Europe/Paris:20231123T160000
LAST-MODIFIED:20231115T145100Z
LOCATION:DIAG - Aula Magna
SUMMARY:Seminario Bernhard von Stengel (London School of Economics) - Zero-
 sum Games and LP Duality  - Bernhard von Stengel (London School of Economi
 cs)
URL;TYPE=URI:http://www.glad.uniroma1.it/node/27378
END:VEVENT
END:VCALENDAR