Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

A Tchebysheff-Type Bound on the Expectation of Sublinear Polyhedral Functions

José H. Dulá and Rajluxmi V. Murthy
Operations Research
Vol. 40, No. 5 (Sep. - Oct., 1992), pp. 914-922
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/171817
Page Count: 9
  • Download ($30.00)
  • Cite this Item
A Tchebysheff-Type Bound on the Expectation of Sublinear Polyhedral Functions
Preview not available

Abstract

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 and a set of linear constraints may be used to generate solutions.

Page Thumbnails

  • Thumbnail: Page 
914
    914
  • Thumbnail: Page 
915
    915
  • Thumbnail: Page 
916
    916
  • Thumbnail: Page 
917
    917
  • Thumbnail: Page 
918
    918
  • Thumbnail: Page 
919
    919
  • Thumbnail: Page 
920
    920
  • Thumbnail: Page 
921
    921
  • Thumbnail: Page 
922
    922