Chapter One. Uncertain Linear Optimization Problems and their Robust Counterparts

In this chapter, we introduce the concept of the uncertain Linear Optimization problem and its Robust Counterpart, and study the computational issues associated with the emerging optimization problems. Recall that the Linear Optimization (LO) problem is of the form min x c T x + d : Ax ≤ b , (1.1.1) where x ∈ R n is the vector of decision variables, c ∈ R n and d ∈ R form the objective, A is an m × n constraint matrix, and b ∈ R m is the right hand side vector. Clearly, the constant term d in the objective, while affecting the optimal value, does not affect the optimal solution, this is why it is traditionally skipped. As we shall see, when treating the LO problems with uncertain data there are good reasons not to neglect this constant term. The structure of problem (1.1.1) is given by the number m of constraints and the number n of variables, while the data of the problem are the collection (c, d, A, b), which we will arrange into an (m + 1) × (n + 1) data matrix D = c T d A b. Usually not all constraints of an LO program, as it arises in applications, are of the form a T x ≤ const; there can be linear " ≥ " inequalities and linear equalities as well. Clearly, the constraints of the latter two types can be represented equivalently by linear " ≤ " inequalities, and we will assume henceforth that these are the only constraints in the problem. Typically, the data of real world LOs (Linear Optimization problems) is not known exactly. The most common reasons for data uncertainty are as follows: • Some of data entries (future demands, returns, etc.) do not exist when the problem is solved and hence are replaced with their forecasts. These data entries are thus subject to prediction errors; • Some of the data (parameters of technological devices/processes, contents associated with raw materials, etc.) cannot be measured exactly – in reality their values drift around the measured " nominal " values; these data are subject to measurement errors; • Some of the decision variables (intensities with which we intend to use various technological processes, parameters of physical devices we are designing, etc.) cannot be implemented exactly as computed. The resulting implementation errors are equivalent to appropriate artificial data uncertainties. Indeed, …

[1]  Melvyn Sim,et al.  Robust linear optimization under general norms , 2004, Oper. Res. Lett..

[2]  Melvyn Sim,et al.  Tractable Approximations to Robust Conic Optimization Problems , 2006, Math. Program..

[3]  A. Ben-Tal,et al.  Adjustable robust solutions of uncertain linear programs , 2004, Math. Program..

[4]  A. Nemirovski,et al.  Robust Semidefinite Programming ∗ , 2008 .

[5]  Kees Roos,et al.  Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems , 2002, SIAM J. Optim..

[6]  Tamás Terlaky,et al.  A Survey of the S-Lemma , 2007, SIAM Rev..

[7]  Alexander Shapiro,et al.  Convex Approximations of Chance Constrained Programs , 2006, SIAM J. Optim..

[8]  Arkadi Nemirovski,et al.  Robust solutions of uncertain linear programs , 1999, Oper. Res. Lett..

[9]  A. Prékopa,et al.  Programming Under Probabilistic Constraint with Discrete Random Variable , 1998 .

[10]  Yury V. Nikulin,et al.  Robustness in combinatorial optimization and scheduling theory: An extended annotated bibliography , 2004 .

[11]  E. Yaz Linear Matrix Inequalities In System And Control Theory , 1998, Proceedings of the IEEE.

[12]  R. Hildebrand An LMI description for the cone of Lorentz-positive maps , 2007 .

[13]  Darinka Dentcheva,et al.  Concavity and efficient points of discrete distributions in probabilistic programming , 2000, Math. Program..

[14]  Melvyn Sim,et al.  Robust discrete optimization and network flows , 2003, Math. Program..

[15]  Arkadi Nemirovski,et al.  Free Material Design via Semidefinite Programming: The Multiload Case with Contact Conditions , 1999, SIAM Rev..

[16]  Xiang Li,et al.  Probabilistically Constrained Linear Programs and Risk-Adjusted Controller Design , 2005, SIAM J. Optim..

[17]  Arkadi Nemirovski,et al.  Robust solutions of Linear Programming problems contaminated with uncertain data , 2000, Math. Program..

[18]  Tamás Terlaky,et al.  On maximization of quadratic form over intersection of ellipsoids with common center , 1999, Math. Program..

[19]  G. Schechtman,et al.  Remarks on Talagrand’s deviation inequality for Rademacher functions , 1990, math/9201208.

[20]  Andrew Packard,et al.  The complex structured singular value , 1993, Autom..

[21]  Arkadi Nemirovski,et al.  Robust dissipativity of interval uncertain systems , 2004 .

[22]  Kees Roos,et al.  Extended Matrix Cube Theorems with Applications to µ-Theory in Control , 2003, Math. Oper. Res..

[23]  Arkadi Nemirovski,et al.  Sums of random symmetric matrices and quadratic optimization under orthogonality constraints , 2007, Math. Program..

[24]  Laurent El Ghaoui,et al.  Robust Solutions to Uncertain Semidefinite Programs , 1998, SIAM J. Optim..

[25]  Thomas D. Sandry,et al.  Probabilistic and Randomized Methods for Design Under Uncertainty , 2007, Technometrics.

[26]  Yonina C. Eldar,et al.  Robust mean-squared error estimation in the presence of model uncertainties , 2005, IEEE Transactions on Signal Processing.

[27]  C. Borell The Brunn-Minkowski inequality in Gauss space , 1975 .

[28]  Josef Hadar,et al.  Rules for Ordering Uncertain Prospects , 1969 .

[29]  Marco C. Campi,et al.  Decision Making in an Uncertain Environment: the Scenario based Optimization Approach , 2004 .

[30]  G. Pisier Non-commutative vector valued Lp-spaces and completely p-summing maps , 1993, math/9306206.

[31]  Alexander Shapiro,et al.  Stochastic programming approach to optimization under uncertainty , 2007, Math. Program..

[32]  Laurent El Ghaoui,et al.  Robust Solutions to Least-Squares Problems with Uncertain Data , 1997, SIAM J. Matrix Anal. Appl..

[33]  Boaz Golany,et al.  Supplier-Retailer Flexible Commitments Contracts : A Robust Optimization Approach , 2003 .

[34]  Martin P. Bendsøe,et al.  Optimization of Structural Topology, Shape, And Material , 1995 .

[35]  Allen L. Soyster,et al.  Technical Note - Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming , 1973, Oper. Res..

[36]  R. Jagannathan,et al.  Chance-Constrained Programming with Joint Constraints , 1974, Oper. Res..

[37]  J. Tropp The random paving property for uniformly bounded matrices , 2006, math/0612070.

[38]  Henry Wolkowicz,et al.  Handbook of Semidefinite Programming , 2000 .

[39]  Bruce A. Cox Applications of accuracy certificates for problems with convex structure , 2011 .

[40]  Garud Iyengar,et al.  Ambiguous chance constrained problems and robust optimization , 2006, Math. Program..

[41]  M. Rothschild,et al.  Increasing risk II: Its economic consequences , 1971 .

[42]  Arkadi Nemirovski,et al.  Robust Modeling of Multi-Stage Portfolio Problems , 2000 .

[43]  András Prékopa,et al.  ON PROBABILISTIC CONSTRAINED PROGRAMMING , 2015 .

[44]  Boris Polyak Convexity of Quadratic Transformations and Its Use in Control and Optimization , 1998 .

[45]  Benjamin Van Roy,et al.  On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming , 2004, Math. Oper. Res..

[46]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[47]  Paul Van Dooren,et al.  Optimization Problems over Positive Pseudopolynomial Matrices , 2003, SIAM J. Matrix Anal. Appl..

[48]  Arkadi Nemirovski,et al.  Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.

[49]  Ioana Popescu,et al.  Optimal Inequalities in Probability Theory: A Convex Optimization Approach , 2005, SIAM J. Optim..

[50]  J. Stiglitz,et al.  Increases in risk and in risk aversion , 1974 .

[51]  L. Khachiyan COMMUNICATIONS OF THE MOSCOW MATHEMATICAL SOCIETY: The problem of calculating the volume of a polyhedron is enumerably hard , 1989 .

[52]  Jan Dhaene,et al.  The Concept of Comonotonicity in Actuarial Science and Finance: Theory , 2002, Insurance: Mathematics and Economics.

[53]  Robert Grover Brown,et al.  Introduction to random signals and applied Kalman filtering : with MATLAB exercises and solutions , 1996 .

[54]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[55]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

[56]  János D. Pintér,et al.  Deterministic approximations of probability inequalities , 1989, ZOR Methods Model. Oper. Res..

[57]  Stephen P. Boyd,et al.  Extending Scope of Robust Optimization: Comprehensive Robust Counterparts of Uncertain Problems , 2006, Math. Program..

[58]  Melvyn Sim,et al.  The Price of Robustness , 2004, Oper. Res..

[59]  Eric C. Kerrigan,et al.  Optimization over state feedback policies for robust control with constraints , 2006, Autom..

[60]  Jan Karel Lenstra,et al.  History of mathematical programming : a collection of personal reminiscences , 1991 .

[61]  Yurii Nesterov,et al.  Squared Functional Systems and Optimization Problems , 2000 .

[62]  H. Levy,et al.  Efficiency analysis of choices involving risk , 1969 .

[63]  A. Charnes,et al.  Cost Horizons and Certainty Equivalents: An Approach to Stochastic Programming of Heating Oil , 1958 .

[64]  Giuseppe Carlo Calafiore,et al.  Uncertain convex programs: randomized solutions and confidence levels , 2005, Math. Program..

[65]  A. Nemirovski On tractable approximations of randomly perturbed convex constraints , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[66]  Arkadi Nemirovski,et al.  Selected topics in robust convex optimization , 2007, Math. Program..

[67]  A. Buchholz Operator Khintchine inequality in non-commutative probability , 2001 .

[68]  M. Rothschild,et al.  Increasing risk: I. A definition , 1970 .

[69]  C. Singh Convex programming with set-inclusive constraints and its applications to generalized linear and fractional programming , 1982 .

[70]  Arkadi Nemirovski,et al.  On Tractable Approximations of Uncertain Linear Matrix Inequalities Affected by Interval Uncertainty , 2002, SIAM J. Optim..

[71]  Y. Nesterov Semidefinite relaxation and nonconvex quadratic optimization , 1998 .