BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Yuriy Zinchenko (Gurobi and University of Calgary)
DTSTART:20251125T233000Z
DTEND:20251126T003000Z
DTSTAMP:20260513T193317Z
UID:SFUOR/65
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/SFUOR/65/">C
 an an infeasible MIP solve itself?</a>\nby Yuriy Zinchenko (Gurobi and Uni
 versity of Calgary) as part of PIMS-CORDS SFU Operations Research Seminar\
 n\nLecture held in ASB 10908.\n\nAbstract\nThe analysis of why a specific 
 MIP instance is infeasible formally can be reduced to computing an Irreduc
 ible Infeasible Subset (IIS) of the constraints. Unlike the case of LP\, f
 or MIP there is no useful duality that can be employed to facilitate such 
 computations. The process of determining an IIS for MIP is typically handl
 ed with brute force\, e.g.\, by use of deletion filters and alike\, thus r
 endering IIS determination for a MIP into a much harder computational task
 . We will discuss one approach to optimizing this process and what compone
 nts of this approach could make it into the newest version of Gurobi.\n
LOCATION:https://researchseminars.org/talk/SFUOR/65/
END:VEVENT
END:VCALENDAR