Back to school,
learn about the latest developments in Operations Research
Title: Practical robust optimization - part 1 and 2
Abstract:
This tutorial will provide you a basic understanding of practical robust optimization, which is indispensable for each Operations Research practitioner.
Optimization problems in practice often contain parameters that are uncertain, due to e.g. estimation or rounding. The idea of robust optimization is to find a solution that is immune against these uncertainties. The last decade efficient methods have been developed to find such robust solutions. The underlying idea is to formulate an uncertainty region for the uncertain parameters, and then require that the constraints should hold for all parameter values in this uncertainty region. It can be shown that e.g. for linear programming, for the most important choices of the uncertainty region, the final problem can be reformulated as linear programming or conic quadratic programming problems, for which very efficient solvers are available nowadays. In this talk we restrict ourselves to linear programming. We will treat the basics of robust linear optimization, and also show the huge value of robust optimization in (dynamic) multistage problems. Robust optimization has already shown its high practical value in many fields: logistics, engineering, finance, medicine, etc. Some state-of-the-art modelling packages have already implemented robust optimization technology.
Title: Mixed Integer Nonlinear Programming: Background
Abstract:
The mathematical modeling of systems often requires the use of both nonlinear and discrete components. Discrete components model phenomena such as fixed charges, dichotomies, piecewise linear functions, and general logical relationships between system entities.
Nonlinearities are required to accurately represent phenomena such as covariance, economies of scale, and queuing delays, or physical properties such as pressure, stress, and equilibrium. Problems involving both discrete and nonlinear components are known as mixed-integer nonlinear programs (MINLPs) and are among the most challenging computational optimization problems.
During the talk the theoretical foundations behind modern solution approaches to MINLP will be described. Discussion will center around building blocks such as relaxations, cutting planes, and search techniques that are all combined to build successful algorithms.
Title: Practical application of MINLP
Abstract:
We show how recent developments in mixed integer programming, both linear and nonlinear, have been used in improving software for solving mixed integer nonlinear programming (MINLP) problems. Examples of those developments are preprocessing, probing, callbacks and new heuristics. We demonstrate the benefits by using some real-life problems.
Title: Mixed Integer Nonlinear Programming Applied To Dike Height Optimization
Abstract:
Water-related disasters are an important proportion of natural disasters all over the earth, and due to global warming this proportion is likely to increase even more in the future. Many of these water-related disasters are caused by flooding. Almost half a billion people live on or near deltas, often in megacities, and many of those have experienced severe flooding in the past decade. Floods can have an enormous impact on a region caused by loss of human lives and economical damage. Because the benefit of investing in risk-reducing measures is not immediately visible, and because the probability of such a disaster is often very small, many governments do not pay as much attention to protection as they probably should. Since the severe flooding disaster in the south-western parts of the Netherlands in 1953, the Dutch government is very much aware of the flooding risks that The Netherlands is exposed to. Soon after 1953, Van Dantzig started the cost-benefit analysis of the dike height optimization problem, which tries to find the optimal balance between investing in dikes (costs) and reducing the risks of floods (benefits). Both increasing flood probabilities and economical growth prevent a static solution and enforce repeated future investments in dikes. We extend Van Dantzig's model and try to to answer the fundamental questions of when and how much to invest in which parts of the constituent segments of a dike ring protecting a certain area of land. This problem is solved by formulating it as a Mixed-Integer Nonlinear Programming (MINLP) model. A solution method is proposed that combines the use of state-of-the-art solvers with techniques that exploit the problem structure. Dutch government agencies use the model to analyze the main dike rings in The Netherlands and to propose new safety standards to be incorporated in the Dutch Water Act.