BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Computational Optimisation Group - ECPv6.15.11//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Computational Optimisation Group
X-ORIGINAL-URL:https://optimisation.doc.ic.ac.uk
X-WR-CALDESC:Events for Computational Optimisation Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20150101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20160224T160000
DTEND;TZID=UTC:20160224T160000
DTSTAMP:20260403T220134
CREATED:20170124T102134Z
LAST-MODIFIED:20170124T102134Z
UID:544-1456329600-1456329600@optimisation.doc.ic.ac.uk
SUMMARY:Seminar: On the standard pooling problem and strong valid inequalities
DESCRIPTION:Title: On the standard pooling problem and strong valid inequalitiesSpeaker: Dr. Claudia D AmbrosioAffiliation: Laboratory for Information – Ecole PolytechniqueLocation: Room 311 Huxley BuildingTime: 4:00pm \nAbstract. The focus of this talk will be on the standard pooling problem\, i.e.\, a continuous\, non-convex optimization problem arising in the chemical engineering context. First\, we will introduce the problem that consists of finding the optimal composition of final products obtained by blending in pools different percentages of raw materials. Bilinear terms arise from the requirements on the quality of certain attributes of the final products. The quality is a linear combination of the attributes of the raw materials and intermediate products that compose the final product. Three different classical formulations have been proposed in the literature and their characteristics will be discussed and analysed. In the second part of the talk\, strong relaxations for the pooling problem will be presented. In particular\, we studied a structured non-convex subset of some special cases to derive valid nonlinear convex inequalities that we conjecture\, and proved for a particular case\, to define the convex hull of the non-convex subset. Preliminary computational results on instances from the literature are reported and demonstrate the utility of the inequalities when used in a global optimization solver. This is a joint work with Jeff Linderoth (University of Wisconsin-Madison)\, James Luedtke (University of Wisconsin-Madison)\, Jonas Schweiger (IBM). \nAbout the speaker. Claudia D’Ambrosio is a research scientist (chargé de recherche) at CNRS affiliated at LIX\, Ecole Polytechnique (France). She holds a Computer Science Engineering Master Degree and a PhD in Operations Research from University of Bologna (Italy). Her research speciality is mixed integer nonlinear programming. During her whole carrier\, she was involved both in theoretical and applied research projects. She was awarder the EURO Doctoral Dissertation Award for her PhD thesis supervised by Professor Andrea Lodi and the 2nd award “Prix Robert Faure” (3 candidates are awarded every 3 years) granted by ROADEF society. or more detailed info:
URL:https://optimisation.doc.ic.ac.uk/event/seminar-on-the-standard-pooling-problem-and-strong-valid-inequalities/
END:VEVENT
END:VCALENDAR