A branch and bound method for stochastic integer problems under probabilistic constraints

Optimization Methods and Software

Volumn 17, Issue 3 SPEC., 2002, Pages 359-382

  Beraldi, Patrizia ^a   Ruszczyski, Andrzej ^b  

^a UNIVERSITY OF CALABRIA   (Italy)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Branch and bound; Probabilistic programming; Stochastic integer programming

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; INTEGER PROGRAMMING; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; VECTORS;

PROBABILISTIC PROGRAMMING; STOCHASTIC INTEGER PROGRAMMING PROBLEM;

STOCHASTIC PROGRAMMING;

EID: 0036592120     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/1055678021000033937     Document Type: Article

References (27)

1. S. Ahmed, A.J. King and G. Parija (2000). A. Multi-stage Integer Programming Approach for Capacity Expansion under Uncertainty, Working paper. departemnt of Chemical Engineering, University of Illinois.
2. I. Barany, T. Van Roy and L.A. Wolsey (1984). Uncapacited lot-sizing: the convex hull of solutions. Mathematical Programming Study, 22, 32-43.
3. P. Beraldi and A. Ruszczyński. The probabilistic set covering problem. Operations Research, to appear.
4. G. Belvaux and L.A. Wolsey (1999). LOTSIZELIB: A Library of Models and Matrices for Lot-Sizing Problems, Internal Report. Center for Operations Research and Econometrics, Universite Catholique de Louvain.
5. J.H. Bookbinder and J-Y. Tan (1988). Strategies for the probabilistic lot-sizing problem with service-level constraints. Management Science, 34, 1096-1108.
6. A. Charnes and W. W. Cooper (1958). Chance-constrained programming. Management Science, 5, 73-79.
7. A. Charnes, W.W. Cooper and G.H. Symonds (1958). Cost horizons and certainty equivalents: an approach to stochastic programming of heating oil. Management Science, 4, 235-263.
8. CPLEX, ILOG CPLEX 6.5: User's Manual. CPLEX Optimization, Inc., Incline Village, NV, (1999).
9. H.P. Crowder, E.L. Johnson and M.W. Padberg (1983). Solving large-scale zero-one linear programming problems. Operations Research, 31, 803-834.
10. D. Dentcheva, A. Prékopa and A. Ruszczyński (2000). Concavity and efficient points of discrete distributions in probabilistic programming. Mathematical Programming, 89, 55-77.
11. D. Holmes (1994). A collection of stochastic programming problems. Technical Report 94-11. Department of Industrial and Operations Engineering. University of Michigan, USA.
12. W.K. Klein Haneveld (1988). A stochastic programming approach to multiperiod production planning. Technical Report 276. Institute of Economic Research, University of Groningen, The Netherlands.
13. R.K. Martin (1987). Generating alternative mixed-integer programming models using variable redefinition. Operations Research, 35, 820-831.
14. L.B. Miller and H. Wagner (1965). Change-constrained programming with joint constraints. Operations Research, 13, 930-945.
15. G.L. Nemhauser and L.A. Wolsey (1988). Integer and Combinatorial Optimization. John Wiley & Sons. New York.
16. R.J. Peters, K. Boskama and H.A.E. Kupper (1977). Stochastic programming in production planning: a case with non-simple recourse. Statistica Neerlandica, 31, 113-126.
17. Y. Pochet and L.A. Wolsey (1988). Lot-size models with backlogging: strong reformulations and cutting planes. Mathematical Programming, 40, 317-335.
18. E.L. Porteus (1990). Stochastic inventory theory. Handbooks in Operations Research and Management Science, 2, pp. 605-652, North-Holland, Amsterdam.
19. A. Prékopa (1970). On probabilistic constrained programming. Proceedings of the Princeton Symposium on Mathematical Programming, pp. 113-138. Princeton University Press, New Jersey, USA.
20. A. Prékopa (1973). Contributions to the theory of stochastic programming. Mathematical Programming, 4, 202-221.
21. A. Prékopa (1990). Dual method for solution of one-stage stochastic programming with random rhs obeying a discrete probability distribution. Zeitschrift Fur Operations Research, 34, 441-461.
22. A. Prékopa (1995). Stochastic Programming. Kluwer Academic Publishers, Boston.
23. A. Prékopa, D. Vizvári and T. Badics (1998). Programming under probabilistic constraint with discrete random variable. In: F. Giannesi (Ed.), New Trends in Mathematical Programming, pp. 235-255. Kluwer Academic Publishers, The Netherlands.
24. S. Sen (1992). Relaxations for the probabilistically constrained programs with discrete random variables. Operations Research Letters, 11, 81-86.
25. C.R. Sox (1997). Dynamic lot-sizing with random demand and not-stationary costs. Annals of Operations Research, 20, 155-164.
26. H.M. Wagner and T.M. Whitin (1958). Dynamic version of the economic lot size model. Management Science, 5, 89-96.
27. H. Wagelmans, S.V. Hoesel and A. Kolen (1992). Economic lot sizing: an O (n log n) algorithm that runs in linear time in the Wagner-Whitin case. Operations Research, 40, 145-156.