Abstract
We consider the objective function of a simple integer recourse problem with fixed technology matrix.
Using properties of the expected value function, we prove a relation between the convex hull of this function and the expected value function of a continuous simple recourse program.
We present an algorithm to compute the convex hull of the expected value function in case of discrete right-hand side random variables. Allowing for restrictions on the first stage decision variables, this result is then extended to the convex hull of the objective function.
Similar content being viewed by others
References
P. Kall,Stochastic Linear Programming (Springer, 1976).
W.K. Klein Haneveld, L. Stougie and M.H. van der Vlerk, Stochastic integer programming with simple recourse, Research Memorandum 455, Institute of Economic Research, University of Groningen (1991).
W.K. Klein Haneveld, L. Stougie and M.H. van der Vlerk, An algorithm for the construction of convex hulls in simple integer recourse programming, Ann. Oper. Res., to appear.
F.V. Louveaux and M.H. van der Vlerk, Stochastic programming with simple integer recourse, Math. Progr. 61 (1993) 301–325.
R.T. Rockafellar,Convex Analysis (Princeton University Press, 1970).
R. Schultz, Continuity and stability in two-stage stochastic integer programming, in:Stochastic Optimization; Numerical Methods and Technical Applications, ed. K. Marti, GAMM/IFIP Workshop, Berlin (Springer, 1992) pp. 81–92.
R.J-B. Wets, Solving stochastic programs with simple recourse, Stochastics 10 (1984) 219–242.
Author information
Authors and Affiliations
Additional information
Supported by the National Operations Research Network in the Netherlands (LNMB).
Rights and permissions
About this article
Cite this article
Klein Haneveld, W.K., Stougie, L. & van der Vlerk, M.H. On the convex hull of the simple integer recourse objective function. Ann Oper Res 56, 209–224 (1995). https://doi.org/10.1007/BF02031708
Issue Date:
DOI: https://doi.org/10.1007/BF02031708