A TCHEBYSHEFF-TYPE BOUND ON THE EXPECTATION OF SUBLINEAR POLYHEDRAL FUNCTIONS.

This work presents an upper bound on the expectation of sublinear polyhedral functions of multivariate random variables based on an inner linearization and domination by a quadratic function. The problem is formulated as a semi-infinite program which requires information on the first and second moments of the distribution, but without the need of an independence assumption. Existence of a solution and stability of this semi-infinite program are discussed. We show that an equivalent optimization problem with a nonlinear objective function are a set of linear constraints may be used to generate solutions. [ABSTRACT FROM AUTHOR]

Copyright of Operations Research is the property of INFORMS: Institute for Operations Research and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)