|edoc-Server der Humboldt-Universität zu Berlin|
|Author(s):||Miguel A. Lejeune, George Washington University||Title:||Pattern-Based Modeling and Solution of Probabilistically Constrained Optimization Problems|
|Date of Acceptance:||25.08.2010|
Stochastic Programming E-Print Series |
|Editors:||Julie L. Higle; Werner Römisch; Surrajeet Sen|
|Complete Preprint:||pdf (urn:nbn:de:kobv:11-100175076)|
|Keywords (eng):||Boolean function, stochastic programming, combinatorial pattern, probabilistic constraint|
|To appear in:||Operations Research|
|Metadata export: To export the complete metadata set as Endote or Bibtex format please click to the appropriate link.||Endnote Bibtex|
|print on demand: If you click on this icon you can order a print copy of this publication.|
|Diese Seite taggen: These icons lead to social bookmarking systems where you can create and manage personal bookmarks and discover bookmakrs of other users.|
|We propose a new modeling and solution method for probabilistically constrained optimization problems. The methodology is based on the integration of the stochastic programming and combinatorial pattern recognition fields. It permits the very fast solution of stochastic optimization problems in which the random variables are represented by an extremely large number of scenarios. The method involves the binarization of the probability distribution, and the generation of a consistent partially defined Boolean function (pdBf) representing the combination (F,p) of the binarized probability distribution F and the enforced probability level p. We show that the pdBf representing (F,p) can be compactly extended as a disjunctive normal form (DNF). The DNF is a collection of combinatorial p-patterns, each of which defining sufficient conditions for a probabilistic constraint to hold. We propose two linear programming formulations for the generation of p-patterns which can be subsequently used to derive a linear programming inner approximation of the original stochastic problem. A formulation allowing for the concurrent generation of a p-pattern and the solution of the deterministic equivalent of the stochastic problem is also proposed. Results show that large-scale stochastic problems, in which up to 50,000 scenarios are used to describe the stochastic variables, can be consistently solved to optimality within a few seconds.|
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: