All are welcome to attend! Come and ask questions to the best in the field!

Our Advisory Council Members include:
Ray Hoving '69, '71G - Formerly of Bernard Hodes Group
Richard Simek '94, '95G - Hypertherm, Inc.
Karen LaRochelle '99 - LaRochelle Advisors
Ray Pressburger '05 - Accenture
Kathleen Taylor '87 - Johnson & Johnson... Read More

ADMM algorithms have been applied to a variety of problems in the last few years due in part to: the simplicity of the iteration and the ability to exploit problem structure. In this talk, we present an ADMM algorithm for the class of convex quadratic programs (QPs) that arise in the context of Model Predictive Control (MPC) applications. Our convergence analysis... Read More

Over the last several years I have developed a variety of algorithms for faster solution of mixed-integer linear programs, based on a number of insights about branch and bound methods. The seminar will review the insights, the resulting algorithms, and their experimental validation. Topics will include (i) active constraint branching, (ii) branching to force change, (... Read More

Public Lecture 

Computational Progress in Linear and Mixed Integer Programming 

We will look at progress in Linear Programming (LP) and Mixed Integer Programming (MIP) software over the last 25 years. As a result of this progress, modern LP codes are capable of robustly and efficiently solving instances with multiple millions of variables... Read More

Please register here:

Lehigh’s Industrial and Systems Engineering (ISE) Council will be holding their sixth ISE Career Fair on September 16, 2015, a day before the Lehigh University Career Fair on... Read More

In this talk, we will present our recent work on two fundamental optimization problems in electric power systems, namely the optimal power flow (OPF) problem and the unit commitment (UC) problem. The first one is highly non-convex, and the second one is subject to significant uncertainty. In the first-part of the talk, we will present three strong second-order cone... Read More

We consider distributionally robust (DR) single-server scheduling problem variants with a fixed sequence of appointments with random no-shows and service durations. The joint probability distribution is ambiguous and only the support and first moments are given. We study
DR models that incorporate the worst-case expected cost and the worst-case CVaR of waiting,... Read More

In this talk, we consider two online optimization problems. The first one is the online linear programming problem. In this problem, the underlying optimization problem is a linear program, however, its constraint matrix is revealed column by column along with the corresponding
objective coefficient and a decision variable has to be set each time a column is... Read More

MOPTA aims at bringing together a diverse group of people from both discrete and continuous optimization, working on both theoretical and applied aspects. There will be a small number of invited talks from distinguished speakers and contributed talks, spread over three days. Our target is to present a diverse set of exciting new developments from different optimization... Read More

Wing shape is a crucial characteristic that has a large impact on aircraft performance. Wing design optimization has been an active area of research for several decades, but achieving practical designs has been a challenge. One of the main challenges is the wing flexibility, which requires the consideration of both aerodynamics and structures. To address this, the... Read More