|edoc-Server der Humboldt-Universität zu Berlin|
E. Erdogan, Columbia University|
G. Iyengar, Columbia University
|Title:||On two-stage convex chance constrained problems|
|Date of Acceptance:||20.03.2006|
Stochastic Programming E-Print Series |
|Editors:||Julie L. Higle; Werner Römisch; Surrajeet Sen|
|Complete Preprint:||pdf (urn:nbn:de:kobv:11-10066216)|
|Appeared in:||CORC Technical Report TR-2005-2|
|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.|
|In this paper we develop approximation algorithms for two-stage convex chance constrained problems. Nemirovski and Shapiro  formulated this class of problems and proposed an ellipsoid-like iterative algorithm for the special case where the impact function f (x, h) is bi-affine. We show that this algorithm extends to bi-convex f (x, h) in a fairly straightforward fashion. The complexity of the solution algorithm as well as the quality of its output are functions of the radius r of the largest Euclidean ball that can be inscribed in the polytope deﬁned by a random set of linear inequalities generated by the algorithm . Since the polytope determining r is random, computing r is diffiult. Yet, the solution algorithm requires r as an input. In this paper we provide some guidance for selecting r. We show that the largest value of r is determined by the degree of robust feasibility of the two-stage chance constrained problem – the more robust the problem, the higher one can set the parameter r. Next, we formulate ambiguous two-stage chance constrained problems. In this formulation, the random variables deﬁning the chance constraint are known to have a ﬁxed distribution; however, the decision maker is only able to estimate this distribution to within some error. We construct an algorithm that solves the ambiguous two-stage chance constrained problem when the impact function f (x, h) is bi-affine and the extreme points of a certain “dual” polytope are known explicitly.|
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 Sep 2011: