Data driven matrix uncertainty for robust linear programming

In this paper we consider robust linear programs with uncertainty sets defined by the convex hull of a finite number of m×n matrices. Embedded within the matrices are related robust linear programs defined by the rows, columns, and coefficients of the matrices. This results in a nested set of primal (and dual) linear programs with predictably different optimal objective values. The set of matrices also embed a covariance structure for the matrix coefficients and we show that when negative covariances predominate in the rows, more favorable optimal objective values for the primal can be expected.