A Second-Order Cone Programming Approximation to Joint Chance-Constrained Linear Programs
We study stochastic linear programs with joint chance constraints, where the random matrix is a special triangular matrix and the random data are assumed to be normally distributed. The problem can be approximated by another stochastic program, whose optimal value is an upper bound of the original problem. The latter stochastic program can be approximated by two second-order cone programming (SOCP) problems . Furthermore, in some cases, the optimal values of the two SOCPs problems provide a lower bound and an upper bound of the approximated stochastic program respectively. Finally, numerical examples with probabilistic lot-sizing problems are given to illustrate the effectiveness of the two approximations.
Unable to display preview. Download preview PDF.
- 5.Cheng, J., Lisser, A.: A Second-Order Cone Programming approach for Linear programs with joint probabilistic constraints. Accepted in Operational Research Letters (2012)Google Scholar
- 12.Prékopa, A.: On probabilistic constrained programming. In: Proceedings of the Princeton Symposium on Mathematical Programming. Princeton University Press, Princeton (1970)Google Scholar
- 13.Prékopa, A.: Stochastic Programming. Kluwer Academic Publishers, Dordrecht (1995)Google Scholar