BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UM//UM*Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:America/Detroit
TZURL:http://tzurl.org/zoneinfo/America/Detroit
X-LIC-LOCATION:America/Detroit
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20070311T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20071104T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20241018T123244
DTSTART;TZID=America/Detroit:20241003T150000
DTEND;TZID=America/Detroit:20241003T160000
SUMMARY:Careers / Jobs:Internship Lab
DESCRIPTION:*RSVP required to attend. Click \"Join Event\" here: https://app.joinhandshake.com/edu/events/1610250Are you ready to start searching for a great internship? Do you have a few ideas\, but you’re not sure where to get started? Let's talk about search strategy!! Get real-time\, personalized support by checking out the in person Internship Lab. You’ll be guided by one of our Career Coaches who has designed this experience to provide you strategies\, tools\, and motivation to get on the right track with searching for internships. Chat with folks from the University Career Center to explore Handshake\, the University Career Alumni Network (UCAN) and to learn about other tools you can use to build a great job/internship search strategy. **Ifyou're not sure what you're interested in\, consider making an \"ExploringMajor/Career Option\" appointment to get started clarifying your interestswith a career coach in a 1-on-1 setting. Recent Grads: If you are an alumni\, you will not be able to access the link due the University’s policy of discontinuing alumni Zoom accounts 30 days after graduation. Please contact careercenter@umich.edu with the subject line “Recent Grad Help” to receive either a recording of the session or to be set up with a 1:1. Include the name of the workshop/event in your email.
UID:126630-21857451@events.umich.edu
URL:https://events.umich.edu/event/126630
CLASS:PUBLIC
STATUS:CONFIRMED
CATEGORIES:
LOCATION:
CONTACT:
END:VEVENT
BEGIN:VEVENT
DTSTAMP:20240909T160222
DTSTART;TZID=America/Detroit:20241003T150000
DTEND;TZID=America/Detroit:20241003T160000
SUMMARY:Workshop / Seminar:IOE 899: Probing Enhanced Stochastic Programming
DESCRIPTION:About the speaker: Jeff Linderoth is the Harvey D. Spangler Professor in the Department of Industrial and Systems Engineering at the University of Wisconsin-Madison\, and he served as the department's chairperson from 2016 to 2021. Prof. Linderoth holds a courtesy appointment in the Computer Sciences department and as a Discovery Fellow at the Wisconsin Institutes of Discovery. Dr. Linderoth received his Ph.D. degree from the Georgia Institute of Technology in 1998. He was previously employed in the Mathematics and Computer Science Division at Argonne National Laboratory\, with the optimization-based financial products firm of Axioma\, and as an Assistant Professor at Lehigh University. His awards include multiple best paper awards\, an Early Career Award from the Department of Energy\, the SIAM Activity Group on Optimization Prize\, and the INFORMS Computing Society (ICS) Prize. In 2016\, he was elected to membership as an INFORMS Fellow. Dr. Linderoth was once stranded in Marseille with Jon Lee for five days.\n\nAbstract: We consider a two-stage stochastic decision problem where the decision-maker has the opportunity to obtain information about the distribution of the random variables X through a set of discrete actions that we refer to as probing.  Specifically\, probing allows the decision-maker to observe components of a random vector Y that is jointly distributed with X. We propose a three-stage optimization model for this problem\, wherein the first-stage variables select components of Y to observe\, and decisions in subsequent stages must be consistent with the obtained information.  In the case that X and Y have finite support\, Goel and Grossmann gave a mixed-integer programming formulation of this problem whose size is proportional to the square of cardinality of the sample space of the random variables.   We propose to solve the model using bounds obtained from an information-based relaxation\, combined with a branching scheme that enforces the consistency of decisions with observed information.  The branch-and-bound approach can naturally be combined with sampling in order to estimate both lower and upper bounds on the optimal solution value.  We demonstrate the scalability of our approach against the exact MIP formulation on instances of a stochastic facility location problem.
UID:126048-21856456@events.umich.edu
URL:https://events.umich.edu/event/126048
CLASS:PUBLIC
STATUS:CONFIRMED
CATEGORIES:Industrial And Operations Engineering,Michigan Engineering,seminar,Statistics
LOCATION:Industrial and Operations Engineering Building - 1680
CONTACT:
END:VEVENT
END:VCALENDAR