Semidefinite programming models for minimax stochastic programs

Karthik Natarajan
City University Hong Kong

In this talk, we discuss the complexity of a class of minimax stochastic optimization problems. For random right hand side with partial distribution information on the first two moments, this problem is NP-hard. We review some techniques to tackle this problem.

Back to Workshop IV: Robust Optimization