BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//ALOP - ECPv5.2.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:ALOP
X-ORIGINAL-URL:https://alop.uni-trier.de
X-WR-CALDESC:Events for ALOP
BEGIN:VTIMEZONE
TZID:Europe/Berlin
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20200329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20201025T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20200129T140000
DTEND;TZID=Europe/Berlin:20200218T171500
DTSTAMP:20200929T231204
CREATED:20191017T123456Z
LAST-MODIFIED:20191017T124620Z
UID:3138-1580306400-1582046100@alop.uni-trier.de
SUMMARY:Short course on the Introduction to Mixed-Integer Nonlinear Optimization
DESCRIPTION:Prof. Dr. Martin Schmidt\, a Principal Investigator of the Research Training Group on Algorithmic Optimization\, is offering a short course on the Introduction to Mixed-Integer Nonlinear Optimization. \nThe course will consist of 4 x 2 lectures of 90 minutes each on the following dates and times: \nWednesday\, 21 January 2020 14:00 – 17:15 HS 10 \nWednesday\, 5 February 2020 14:00 – 17:15 HS 10 \nWednesday\, 12 February 2020 14:00 – 17:15 HS 10 \nTuesday\, 18 February 2020 14:00 – 17:15 HS 10 \nCourse Abstract: \nMixed-integer nonlinear optimization problems (MINLPs) are of great importance in practice because they allow for two crucial modeling aspects. First\, using integer variables makes it possible to model decision-making. Second\, accurate modeling of real-world phenomena often leads to nonlinearities like in physics or in models of economies of scale. However\, the combination of integer variables and nonlinearities also makes these problems extremely hard to solve for large-scale instances of real-world applications. \n \nIn this compact course\, we introduce the class of convex and nonconvex MINLPs\, discuss some MINLP-specific modeling tricks\, and study the basic algorithms for solving MINLPs. \nFor a printout of this information\, please click here. \nCourse outline: \nDay 1: Introduction to the problem class of MINLPs\n* Definition of problem class\n* Convex vs. nonconvex MINLP\n* Modeling examples\n* Modeling techniques\n* Good and bad formulations\n* General algorithmic techniques for solving MINLPs \nDay 2: Algorithmic techniques\n* Nonlinear branch-and-bound\n* Kelley’s cutting plane method\n* Outer approximation\n* LP-/NLP-based branch-and-bound \nDay 3: Getting rid of what makes the problem hard\n* MIP-based solution techniques\n* NLP-based solution techniques \nDay 4: Nonconvex MINLPs and Software\n* Under- and overestimators\n* expression trees\n* Generic relaxation strategies for nonconvex MINLPs\n* Spatial branch-and-bound\n* Modeling software (GAMS\, AMPL\, Pyomo)\n* Solvers \n
URL:https://alop.uni-trier.de/event/short-course-on-the-introduction-to-mixed-integer-nonlinear-optimization/
CATEGORIES:Short Course
END:VEVENT
END:VCALENDAR