<html>
  <head>

    <meta http-equiv="content-type" content="text/html; charset=UTF-8">
  </head>
  <body text="#000000" bgcolor="#FFFFFF">
    <h3 style="box-sizing: border-box; font-family: arial, verdana,
      velvetica, sans-serif; font-weight: 500; line-height: 1.1; color:
      rgb(32, 34, 37); margin-top: 20px; margin-bottom: 10px; font-size:
      18px; vertical-align: middle; font-style: normal;
      font-variant-ligatures: normal; font-variant-caps: normal;
      letter-spacing: normal; orphans: 2; text-align: left; text-indent:
      0px; text-transform: none; white-space: normal; widows: 2;
      word-spacing: 0px; -webkit-text-stroke-width: 0px;
      background-color: rgba(0, 0, 0, 0.02); text-decoration-style:
      initial; text-decoration-color: initial;">CRM/DIMACS Workshop on
      Mixed-Integer Nonlinear Programming</h3>
    <p class="bold" style="box-sizing: border-box; margin: 0px 0px 10px;
      color: rgb(32, 34, 37); font-family: Lora, Georgia, "Times
      New Roman", Times, serif; font-size: 18px; font-style:
      normal; font-variant-ligatures: normal; font-variant-caps: normal;
      font-weight: 400; letter-spacing: normal; orphans: 2; text-align:
      left; text-indent: 0px; text-transform: none; white-space: normal;
      widows: 2; word-spacing: 0px; -webkit-text-stroke-width: 0px;
      background-color: rgba(0, 0, 0, 0.02); text-decoration-style:
      initial; text-decoration-color: initial;">October 07, 2019 -
      October 10, 2019</p>
    <div id="organizer-content" class="location" style="box-sizing:
      border-box; color: rgb(32, 34, 37); font-family: Lora, Georgia,
      "Times New Roman", Times, serif; font-size: 18px;
      font-style: normal; font-variant-ligatures: normal;
      font-variant-caps: normal; font-weight: 400; letter-spacing:
      normal; orphans: 2; text-align: left; text-indent: 0px;
      text-transform: none; white-space: normal; widows: 2;
      word-spacing: 0px; -webkit-text-stroke-width: 0px;
      background-color: rgba(0, 0, 0, 0.02); text-decoration-style:
      initial; text-decoration-color: initial;">
      <p class="organizer-title bold" style="box-sizing: border-box;
        margin: 0px 0px 10px;">Location:</p>
      <p class="organizer-name" style="box-sizing: border-box; margin:
        0px 0px 10px;">Université de Montréal Campus</p>
    </div>
    <div id="organizer-content" style="box-sizing: border-box; color:
      rgb(32, 34, 37); font-family: Lora, Georgia, "Times New
      Roman", Times, serif; font-size: 18px; font-style: normal;
      font-variant-ligatures: normal; font-variant-caps: normal;
      font-weight: 400; letter-spacing: normal; orphans: 2; text-align:
      left; text-indent: 0px; text-transform: none; white-space: normal;
      widows: 2; word-spacing: 0px; -webkit-text-stroke-width: 0px;
      background-color: rgba(0, 0, 0, 0.02); text-decoration-style:
      initial; text-decoration-color: initial;">
      <p class="organizer-title bold" style="box-sizing: border-box;
        margin: 0px 0px 10px;">Organizer(s):</p>
      <p class="organizer-name" style="box-sizing: border-box; margin:
        0px 0px 10px;">Andrea Lodi, Polytechnique Montréal</p>
      <p class="organizer-name" style="box-sizing: border-box; margin:
        0px 0px 10px;">Bruce Shepherd, University of British Columbia<br
          style="box-sizing: border-box;">
        <br style="box-sizing: border-box;">
      </p>
      <p style="box-sizing: border-box; margin: 0px 0px 10px;">Mixed-Integer
        Nonlinear Programming (MINLP) is the study of optimization
        models which combine discrete and/or continuous variables with
        non-linear constraints and objectives.   As special cases, the
        fields of mixed-integer linear programming (MILP) and purely
        continuous convex or local nonlinear optimization (NLP) are
        relatively well-developed fields. The ambitious goal of MINLP is
        to work towards a fusion of the methods for discrete (MILP) and
        continuous (NLP), thereby extending the theoretical  advances
        and  broad applied impact enjoyed by  MILP and NLP.</p>
      <p style="box-sizing: border-box; margin: 0px 0px 10px;">Positive
        complexity results for MILP and NLP are well known. However,
        MINLP is a very broad modeling paradigm which, in its general
        form, produces undecidable computational questions. There have
        been, however, meaningful restrictions that have allowed some
        analysis in terms of exact and approximation algorithms. These
        include polynomial (quadratics in particular) objectives and
        constraints, (quasi-) convex function minimization, submodular
        function maximization, and reduced-dimensional functions. This
        very active line of research helps delineate the limits of what
        we can hope for from practical algorithms and software.
        Convexification techniques are playing an important role in this
        work, as it does in integer-linear optimization and global
        optimization for purely continuous optimization.  Other
        techniques are simulatenously being developed, including methods
        based on algebraic geometry and number theory.</p>
      <p style="box-sizing: border-box; margin: 0px 0px 10px;">Mixed-integer
        nonlinear programming is an attractive paradigm because it can
        naturally model the physics of a system (via continuous
        variables) and planning decisions (often via discrete
        variables). Because of demand from practitioners in many areas
        (but notably, chemical engineering, power-systems engineering,
        and operations research), there are many  sophisticated
        "general-purpose" software packages for mixed-integer nonlinear
        optimization. In addition, packages first conceived for
        mixed-integer linear programming now start to handle non-convex
        quadratic functions. Similarly, packages first conceived for
        (purely continuous) semi-definite programs and handling linear
        matrix inequalities are now emerging  to handle discrete
        variables. Work in mixed-integer nonlinear optimization has
        informed this growth and evolution in solvers, and this workshop
        aims to continue and accelerate the momentum in software growth.</p>
      <p style="box-sizing: border-box; margin: 0px 0px 10px;">There
        remain theoretical, algorithmic, and computational challenges to
        surmount before MINLP can enjoy a success that is comparable to
        MILP or NLP. These challenges, together with the potential for
        remarkable impact, make MINLP arguably the most exciting
        frontier in mathematical optimization.</p>
      <p style="box-sizing: border-box; margin: 0px 0px 10px;">The
        workshop will be held at Polytechnique Montréal in collaboration
        with a month-long program on<span style="box-sizing:
          border-box;"> </span><a
href="http://www.crm.math.ca/crm50/en/category/mixed-integer-programming/"
          target="_blank" rel="noopener" style="box-sizing: border-box;
          background: transparent; color: rgb(0, 48, 135);
          text-decoration: underline; cursor: pointer;">Mixed Integer
          Nonlinear Programming</a><span style="box-sizing: border-box;"> </span>in
        October 2019 that is sponsored by the<span style="box-sizing:
          border-box;"> </span><a
          href="http://www.crm.math.ca/crm50/en/" target="_blank"
          rel="noopener" style="box-sizing: border-box; background:
          transparent; color: rgb(0, 48, 135); text-decoration:
          underline; cursor: pointer;">Centre de Recherches
          Mathématiques</a><span style="box-sizing: border-box;"> </span>(CRM).<br
          style="box-sizing: border-box;">
        <br style="box-sizing: border-box;">
      </p>
      <p style="box-sizing: border-box; margin: 0px 0px 10px;"><strong
          style="box-sizing: border-box; font-weight: bold;">Advisory
          Committee:</strong></p>
      <p style="box-sizing: border-box; margin: 0px 0px 10px;">Claudia
        D'Ambrosio (École Polytechnique, Paris), Marcia Fampa (Federal
        University of Rio de Janeiro), Fatma Kilinc-Karzan (Carnegie
        Mellon University), Jon Lee (University of Michigan)<br
          style="box-sizing: border-box;">
        <br style="box-sizing: border-box;">
      </p>
      <p style="box-sizing: border-box; margin: 0px 0px 10px;"><strong
          style="box-sizing: border-box; font-weight: bold;">Confirmed
          speakers include:</strong></p>
      <p style="box-sizing: border-box; margin: 0px 0px 10px;">Amir Ali
        Ahmadi (Princeton University)</p>
      <p style="box-sizing: border-box; margin: 0px 0px 10px;">Dan
        Bienstock (Columbia University)</p>
      <p style="box-sizing: border-box; margin: 0px 0px 10px;">Christoph
        Buchheim (TU Dortmund)</p>
      <p style="box-sizing: border-box; margin: 0px 0px 10px;">Santanu
        Dey (Georgia Tech)</p>
      <p style="box-sizing: border-box; margin: 0px 0px 10px;">Aida
        Khajavirad (Rutgers University)</p>
      <p style="box-sizing: border-box; margin: 0px 0px 10px;">Leo
        Liberti (CNRS)</p>
      <p style="box-sizing: border-box; margin: 0px 0px 10px;">Jeff
        Linderoth (University of Wisconsin)</p>
      <p style="box-sizing: border-box; margin: 0px 0px 10px;">Sabastian
        Sager (Otto von Guericke University, Magdeburg)</p>
      <p style="box-sizing: border-box; margin: 0px 0px 10px;">Nick
        Sahinidis (Carnegie Mellon University)</p>
      <p style="box-sizing: border-box; margin: 0px 0px 10px;">Renata
        Sotirov (Tilburg University)</p>
      <p style="box-sizing: border-box; margin: 0px 0px 10px;">Mohit
        Tawarmalani (Purdue University)</p>
      <p style="box-sizing: border-box; margin: 0px 0px 10px;">Juan
        Pablo Vielma (MIT)</p>
      <p style="box-sizing: border-box; margin: 0px 0px 10px;">Robert
        Weismantel (ETH Zürich)<br style="box-sizing: border-box;">
        <br style="box-sizing: border-box;">
      </p>
      <div id="sponsor-content" style="box-sizing: border-box;">
        <p style="box-sizing: border-box; margin: 0px 0px 10px;">Sponsored
          by Centre de Recherches Mathématiques and DIMACS, in
          association with the<span style="box-sizing: border-box;"> </span><a
href="http://dimacs.rutgers.edu/programs/sf/sf-optimization/"
            target="blank" style="box-sizing: border-box; background:
            transparent; color: rgb(0, 48, 135); text-decoration:
            underline; cursor: pointer;">Special Focus on Bridging
            Continuous and Discrete Optimization</a>.</p>
      </div>
      <div id="registration-button" style="box-sizing: border-box;">
        <p style="box-sizing: border-box; margin: 0px 0px 10px;">Registration
          is required but not yet open.<br style="box-sizing:
            border-box;">
          <br style="box-sizing: border-box;">
          <a href="http://dimacs.rutgers.edu/events/details?eID=%20321"
            target="_blank" rel="noopener" style="box-sizing:
            border-box; background: transparent; color: rgb(0, 48, 135);
            text-decoration: underline; cursor: pointer;">http://dimacs.rutgers.edu/events/details?eID=%20321</a></p>
      </div>
    </div>
    <pre class="moz-signature" cols="72">-- 
Jon Lee
Industrial and Operations Engineering Department
1205 Beal Avenue
University of Michigan
Ann Arbor, MI 48109-2117
USA
</pre>
  </body>
</html>