This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed polytopic constraints on the states and inputs. The problem of computing an optimal state feedback control policy, given the current state, is non-convex. A recent breakthrough has been the application of robust optimization techniques … Read more
We propose a unified theory that links uncertainty sets in robust optimization to risk measures in portfolio optimization. We illustrate the correspondence between uncertainty sets and some popular risk measures in finance, and show how robust optimization can be used to generalize the concepts of these measures. We also show that by using properly defined … Read more
Most research in robust optimization has so far been focused on inequality-only, convex conic programming with simple linear models for uncertain parameters. Many practical optimization problems, however, are nonlinear and non-convex. Even in linear programming, coefficients may still be nonlinear functions of uncertain parameters. In this paper, we propose robust formulations that extend the robust-optimization … Read more
In this paper, we introduce an approach for constructing uncertainty sets for robust optimization using new deviation measures for bounded random variables known as the forward and backward deviations. These deviation measures capture distributional asymmetry and lead to better approximations of chance constraints. We also propose a tractable robust optimization approach for obtaining robust solutions … Read more
In this paper, we propose a new methodology for handling optimization problems with uncertain data. With the usual Robust Optimization paradigm, one looks for the decisions ensuring a required performance for all realizations of the data from a given bounded uncertainty set, whereas with the proposed approach, we require also a controlled deterioration in performance … Read more
We present mixed integer linear programming models that are robust in the face of uncertain traffic demands known to lie in a certain polyhedron for the problem of dense wavelength division multiplexing network routing and provisioning at minimal cost. We investigate the solution of the problem in a set of numerical experiments for two models … Read more
We investigate a network design problem under traffic uncertainty which arises when provisioning Virtual Private Networks (VPNs): given a set of terminals that must communicate with one another, and a set of possible traffic matrices, sufficient capacity has to be reserved on the links of the large underlying public network so as to support all … Read more
We describe a two-stage robust optimization approach for solving network flow and design problems with demand uncertainty. We give an explicit characterization of the first-stage decisions and prove that the corresponding separation problem is NP-hard even for a network flow problem on a bipartite graph. We show, however, that if the second-stage network topology is … Read more
We consider a chance constrained problem, where one seeks to minimize a convex objective over solutions satisfying, with a given (close to one) probability, a system of randomly perturbed convex constraints. Our goal is to build a computationally tractable approximation of this (typically intractable) problem, i.e., an explicitly given convex optimization program with the feasible … Read more
This extended annotated bibliography focuses on what has been published during the last ten years in the area of combinatorial optimization and scheduling theory concerning robustness and other similar techniques dealing with worst case optimization under uncertainty and non-accuracy of problem data CitationChristian-Albrechts University in Kiel, Institute of Production and Logistics, Working paper ArticleDownload View … Read more