BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//College of Engineering - University of Wisconsin-Madison - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://engineering.wisc.edu
X-WR-CALDESC:Events for College of Engineering - University of Wisconsin-Madison
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:20240310T080000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:20241103T070000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:20250309T080000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:20251102T070000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:20260308T080000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:20261101T070000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20251003T120000
DTEND;TZID=America/Chicago:20251003T130000
DTSTAMP:20260428T235541
CREATED:20250918T131424Z
LAST-MODIFIED:20250918T193205Z
UID:10001332-1759492800-1759496400@engineering.wisc.edu
SUMMARY:Strong duals for mixed integer programs.
DESCRIPTION:UW-ISyE looks forward to welcoming Dr. Santanu Dey\, Professor at  H. Milton Stewart School of Industrial and Systems Engineering at Georgia Institute of Technology.  \n\n\n\n\n\n\n\nWe develop two general-purpose strong dual formulations for binary MINLPs\, motivated by sensitivity analysis and distributed computation. For mixed binary quadratic programs (MBQPs)\, we show that the copositive dual of Burer’s completely positive reformulation has no duality gap when the feasible region is bounded or the objective is convex. Since the right-hand side of the original MBQP appears only in the dual’s objective\, this formulation enables sensitivity analysis. For nearly decomposable nonlinear mixed binary programs\, we propose a hierarchy of relaxations that preserve decomposability. The first level coincides with the classical Lagrangian relaxation\, while higher levels yield progressively tighter bounds\, culminating in a strong dual. We analyze the quality of these bounds for various types of MILPs. This is joint work with Diego Cifuentes and Jingye Xu. \n\n\n\n\n\nBio: Santanu S. Dey is an Anderson-Interface professor and director of doctorial recruiting and admissions in the H. Milton Stewart School of Industrial and Systems Engineering at Georgia Institute of Technology. Dr. Dey’s research interests are in the area of non-convex optimization\, and in particular mixed integer linear and nonlinear programming. His research is partly motivated by applications of non-convex optimization problems arising in areas such as electrical power engineering\, process engineering\, civil engineering\, logistics\, and statistics. He currently serves on the editorial board of Mathematical Programming A\, Mathematics of Operations Research and SIAM Journal on Optimization. He has previously served as an area editor for Mathematical Programming C and associate editor of INFORMS Journal on Computing. He has won the INFORMS Nicholson student paper competition\, IBM Faculty Award\, the Class of 1969 Teaching Fellow at Georgia Tech\, the NSF CAREER award\, the INFORMS Energy Natural Resources and Environment best paper award\, and the INFORMS optimization society Balas Prize.
URL:https://engineering.wisc.edu/event/strong-duals-for-mixed-integer-programs/
LOCATION:1163 Mechanical Engineering\, 1513 Engineering Dr.\, Madison\, WI\, 53706\, United States
CATEGORIES:Colloquium,Industrial & Systems Engineering
ATTACH;FMTTYPE=image/png:https://engineering.wisc.edu/wp-content/uploads/2025/09/deygraphic.avif
END:VEVENT
END:VCALENDAR