ISyE Colloquium

Many robust optimization problems cannot be solved due to computational intractability. In this talk, a new probabilistic solution framework is introduced for robust convex optimization problems. This includes, for instance, robust linear and quadratic programs and the wide class of optimization problems representable by means of parameter-dependent linear matrix inequalities.