|edoc-Server der Humboldt-Universität zu Berlin|
Darinka Dentcheva, RUTCOR, Rutgers University, Piscataway|
András Prékopa, RUTCOR, Rutgers University, Piscataway
Andrzej Ruszczynski, RUTCOR, Rutgers University, Piscataway
|Title:||Concavity and Efficient Points of Discrete Distributions in Probabilistic Programming|
|Date of Acceptance:||29.11.1999|
Stochastic Programming E-Print Series |
|Editors:||Julie L. Higle; Werner Römisch; Surrajeet Sen|
|Keywords (eng):||discrete distributions, probabilistic programming, generalized concavity, column generation|
Mathematical Programming 1.2000 (Vol. 89)
Springer (Berlin [u.a.])
|Metadata export: To export the complete metadata set as Endote or Bibtex format please click to the appropriate link.||Endnote Bibtex|
|We consider stochastic programming problems with probabilistic constraints involving integer-valued random variables. The concept of a p-efficient point of a probability distribution is used to derive various equivalent problem formulations. Next we introduce the concept of r-concave discrete probability distributions and analyse its relevance for problems under consideration. These notions are used to derive lower and upper bounds for the optimal value of probabilistically constrained stochastic programming problems with discrete random variables. The results are illustrated with numerical examples.|
These data concerning access statistics for individual documents
have been compiled using the webserver log files aggregated by AWSTATS.
They refer to a monthly access count to the full text documents as well as to the entry page.
As for format versions of a document which consist of multiple files (such as HTML) the highest monthly access number to one of the files (chapters) is shown respectivly.
To see the detailled access numbers please move the mouse pointer over the single bars of the digaram.
Gesamtzahl der Zugriffe seit Jun 2011: