edoc-Server der Humboldt-Universität zu Berlin

# SPEPS Preprint

 Author(s): E. Erdogan, Columbia UniversityG. Iyengar, Columbia University Title: On two-stage convex chance constrained problems Date of Acceptance: 20.03.2006 Submission Date: 03.08.2005 Series Title: Stochastic Programming E-Print Series (SPEPS) 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.

Abstract (eng):
In this paper we develop approximation algorithms for two-stage convex chance constrained problems. Nemirovski and Shapiro [16] 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 [16]. 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.
Access Statistics: 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.
 Sep11 Jan12 Feb12 Apr12 May12 Sep12 Oct12 Nov12 Dec12 Jan13 Feb13 Mar13 Apr13 May13 Jun13 Jul13 Aug13 Sep13 Oct13 Nov13 Dec13 Jan14 Feb14 Mar14 Apr14 May14 Jun14 Jul14 Aug14 Sep14 Oct14 Nov14 Dec14 Jan15 Feb15 Mar15 Apr15 May15 Jun15 Jul15 Aug15 Sep15 Oct15 Nov15 Dec15 Jan16 Feb16 Mar16 Apr16 May16 Jun16 Jul16 Aug16 Sep16 Oct16 Nov16 Dec16 Jan17 Feb17 Mar17
 Monat Sep11 Jan12 Feb12 Apr12 Sep12 Oct12 Nov12 Jan13 Feb13 Mar13 Apr13 May13 Jun13 Jul13 Aug13 Sep13 Oct13 Nov13 Dec13 Jan14 Feb14 May14 Jul14 Aug14 Sep14 Oct14 Nov14 Dec14 Jan15 Feb15 Mar15 Dec15 Jan16 Feb16 Mar16 Apr16 May16 Jul16 Sep16 Jan17 Feb17 Mar17 Startseite 2 1 2 3 1 1 2 2 2 3 9 14 44 15 26 7 4 5 2 5 4 1 1 2 1 4 2 3 3 3 PDF 2 1 1 4 3 10 10 12 18 6 5 4 3 6 4 1 7 17

Gesamtzahl der Zugriffe seit Sep 2011:

• Startseite – 174 (2.9 pro Monat)
• PDF – 114 (2 pro Monat)

Generated at 26.04.2017, 23:32:32