Approximation in stochastic integer programming
AbstractApproximation algorithms are the prevalent solution methods in the field of stochastic programming. Problems in this field are very hard to solve. Indeed, most of the research in this field has concentrated on designing solution methods that approximate the optimal solutions. However, efficiency in the complexity theoretical sense is usually not taken into account. Quality statements mostly remain restricted to convergence to an optimal solution without accompanying implications on the running time of the algorithms for attaining more and more accurate solutions. However, over the last twenty years also some studies on performance analysis of approximation algorithms for stochastic programming have appeared. In this direction we find both probabilistic analysis and worst-case analysis. There have been studies on performance ratios and on absolute divergence from optimality. Only recently the complexity of stochastic programming problems has been addressed, indeed confirming that these problems are harder than most combinatorial optimization problems.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by University of Groningen, Research Institute SOM (Systems, Organisations and Management) in its series Research Report with number 03A14.
Date of creation: 2003
Date of revision:
This paper has been announced in the following NEP Reports:
- NEP-CMP-2003-07-10 (Computational Economics)
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- V.I. Norkin & Y.M. Ermoliev & A. Ruszczynski, 1994. "On Optimal Allocation of Indivisibles Under Uncertainty," Working Papers wp94021, International Institute for Applied Systems Analysis.
- A. Charnes & W. W. Cooper & G. H. Symonds, 1958. "Cost Horizons and Certainty Equivalents: An Approach to Stochastic Programming of Heating Oil," Management Science, INFORMS, vol. 4(3), pages 235-263, April.
- George B. Dantzig, 1955. "Linear Programming under Uncertainty," Management Science, INFORMS, vol. 1(3-4), pages 197-206, 04-07.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joke Bulthuis).
If references are entirely missing, you can add them using this form.