|edoc-Server der Humboldt-Universität zu Berlin|
Suvrajeet Sen, University of Arizona|
Julia L. Higle, University of Arizona
|Title:||The C 3 theorem and a D 2 algorithm for large scale stochastic integer programming – Set convexification|
|Date of Acceptance:||19.12.2000|
Stochastic Programming E-Print Series |
|Editors:||Julie L. Higle; Werner Römisch; Surrajeet Sen|
|Keywords (eng):||Stochastic Mixed-Integer Programming, Disjunctive Programming, Cutting Plane Algorithms|
Mathematical programming 1 (Vol. 104, 2005)
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|
|This paper considers the two stage stochastic integer programming problems, with an emphasis on problems in which integer variables appear in the second stage. Drawing heavily on the theory of disjunctive programming, we characterize convexifications of the second stage problem and develop a decomposition-based algorithm for the solution of such problems. In particular, we verify that problems with fixed recourse are characterized by scenario-dependent second stage convexifications that have a great deal in common. We refer to this characterization as the C^3 (Common Cut Coefficients) Theorem. Based on the C^3 Theorem, we develop an algorithmic methodology that we refer to as Disjunctive Decomposition (D^2). We show that when the second stage consists of 0-1 MILP problems , we can obtain accurate second stage objective function estimates afer finitely many steps. We also set the stage for comparisions between problems in which the first stage includes only 0-1 variables and those that allow both continuous and integer variables in the first stage.|
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: