Computing Bounds for Stochastic Programming Problems by Means of a Generalized Moment Problem (Q3757691)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4005981
Language Label Description Also known as
default for all languages
No label defined
    English
    Computing Bounds for Stochastic Programming Problems by Means of a Generalized Moment Problem
    scientific article; zbMATH DE number 4005981

      Statements

      Computing Bounds for Stochastic Programming Problems by Means of a Generalized Moment Problem (English)
      0 references
      0 references
      0 references
      1987
      0 references
      moment problem
      0 references
      bounds
      0 references
      approximations
      0 references
      stochastic program with recourse
      0 references
      The following (generalized) moment problem is considered. Find a probability measure P on some \(\sigma\)-algebra \({\mathcal A}\) on a subset of \({\mathbb{R}}^ N\) such that \[ \int v_ i(\xi)P(d\xi)\leq \beta_ i,\quad i=1,...,s, \] \[ \int v_ i(\xi)P(d\xi)=\beta_ i,\quad i=s+1,...,m,\quad and\quad z=\int v_ 0(\xi)P(d\xi)\quad is\quad \max imized. \] It is shown how bounds and approximations for this problem can be derived by linear programming. This result is applied to obtain upper bounds for a stochastic program with recourse. A numerical example is given.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references