
doi: 10.1007/bf01582215
The distance between optimal solutions of stochastic linear programs with fixed recourse is analyzed starting from a ``true'' and an ``approximate'' probability measure. The presented estimate relies on the second-order growth condition of the recourse function \(Q\), rather than on a particular choice of the metric of probability measures, suggested earlier in papers of Römisch and Schultz.
stochastic linear programs, Sensitivity, stability, parametric optimization, quantitative stability, Stochastic programming, fixed recourse
stochastic linear programs, Sensitivity, stability, parametric optimization, quantitative stability, Stochastic programming, fixed recourse
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 40 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
