BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260921T211006Z
UID:Seminar-dept-1005@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20220510T130000
DTEND:20220510T140000
SUMMARY:School Seminar Series
DESCRIPTION:Dr. Maximilien Gadouleau: Linear Programming Complementation\n\nIn this talk, we introduce a new kind of duality for Linear Programming (LP), that we call LP complementation. We prove that the optimal values of an LP and of its complement are complement pairs (provided that either the original LP or its complement has an optimal value greater than one). The main consequence of the LP complementation theorem is for hypergraphs. We introduce the complement of a hypergraph and we show that the fractional packing numbers of a hypergraph and of its complement are complement pairs; similar results hold for fractional matching, covering and transversal numbers.\n\n\n\nThis hypergraph complementation theorem has several consequences for fractional graph theory. In particular, we relate the fractional dominating number of a graph to the fractional total dominating number of its complement.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=1005
LOCATION:Ashton Lecture Theatre
END:VEVENT
END:VCALENDAR