Robust Linear Programming with Norm Uncertainty.

We consider the linear programming problem with uncertainty set described by (ρ, ω)-norm. We suggest that the robust counterpart of this problem is equivalent to a computationally convex optimization problem. We provide probabilistic guarantees on the feasibility of an optimal robust solution when the uncertain coefficients obey independent and identically distributed normal distributions. [ABSTRACT FROM AUTHOR]