|edoc-Server der Humboldt-Universität zu Berlin|
Darinka Dentcheva, Stevens Institute of Technology|
Bogumila Lai, Stevens Institute of Technology
Andrzej Ruszczynski, Rutgers University
|Title:||Efficient point methods for probabilistic optimization problems|
|Date of Acceptance:||20.10.2003|
Stochastic Programming E-Print Series |
|Editors:||Julie L. Higle; Werner Römisch; Surrajeet Sen|
|Keywords (eng):||Stochastic Programming, Convex Programming, Probabilistic Constraints, Dual Methods|
Mathematical methods of operations research 2 (Vol. 60, 2004)
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 nonlinear stochastic programming problems with probabilistic constraints. The concept of a p-efficient point of a probability distribution is used to derive equivalent problem formulations, and necessary and sufficient optimality conditions. We analyze the dual functional and its subdifferential. Two numerical methods are developed based on approximations of the p-efficient frontier. The algorithms yield an optimal solution for problems involving r-concave probability distributions. For arbitrary distributions, the algorithms provide upper and lower bounds for the optimal value and nearly optimal solutions. The operation of the methods is illustrated on a cash matching problem with a probabilistic liquidity constraint.|
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 May 2011: