Robust optimization. In some optimization problems there is uncertainty or variation in the objective and constraint functions, due to parameters or factors that are either beyond our control or unknown. We can model this situation by making the objective and constraint functions f0,…,fm functions of the optimization variable x∈Rn and a parameter vector u∈Rk that is unknown, or varies. To simplify the discussion, we assume there are no equality constraints.
(a) Stochastic optimization. We consider the problem
minimizesubject toEf0(x,u)Efi(x,u)≤0,i=1,…,m,
where the expectation is with respect to u. Show that if fi are convex in x for each u, then this stochastic optimization problem is convex.
(b) Worst-case optimization. We consider the problem
minimizesubject tosupu∈Uf0(x,u)supu∈Ufi(x,u)≤0,i=1,…,m.
Show that if fi are convex in x for each u, then this worst-case optimization problem is convex.
(c) Finite set of possible parameter values. Suppose we are given the set of possible values of the parameter is finite, i.e., we have u∈{u1,…,uN}. For the stochastic case, we are also given the probabilities of each value: prob(u=ui)=pi, where p∈RN, p⪰0, 1Tp=1. In the worst-case formulation, we simply take U∈{u1,…,uN}.
Show how to set up the worst-case and stochastic optimization problems explicitly (i.e., give explicit expressions for supu∈Ufi and Eufi).