A Proposed Technique for Solving Scenario Based Multi-Period Stochastic Optimization Problems with Computer Application

Full Text (PDF, 365KB), PP.12-23

Views: 0 Downloads: 0


Sajal Chakroborty 1,* M. Babul Hasan 2

1. Department of Electronics and Communications Engineering, East West University, Dhaka, Bangladesh

2. Department of Mathematics, University of Dhaka, Dhaka, Bangladesh

* Corresponding author.

DOI: https://doi.org/10.5815/ijmsc.2016.04.02

Received: 1 Aug. 2016 / Revised: 31 Aug. 2016 / Accepted: 1 Oct. 2016 / Published: 8 Nov. 2016

Index Terms

SP, DBP, Scenarios, AMPL, LP, Decomposition, Sub-problem, Master problem, Deterministic problem


In this paper, we have presented a new technique for solving scenario based multi-period stochastic programming problems and presented a case study for the business policy of a super shop market in Bangladesh. We have developed our technique based on decomposition based pricing method which is the latest and faster decomposition technique in use. To our knowledge, this is the first work in the field of stochastic programming for solving multi-period stochastic optimization problems by using decomposition based pricing method. We have also developed a model by collecting data of a year from a super shop market of Bangladesh and analyzed their profit by dividing the whole year into four periods for different scenarios of an uncertainty. We have developed a computer code by using mathematical programming language AMPL and analyzed the model by using our developed technique.

Cite This Paper

Sajal Chakroborty, M. Babul Hasan,"A Proposed Technique for Solving Scenario Based Multi-Period Stochastic Optimization Problems with Computer Application", International Journal of Mathematical Sciences and Computing(IJMSC), Vol.2, No.4, pp.12-23, 2016.DOI: 10.5815/ijmsc.2016.04.02


[1]Brige, J. R. and Louveaux, F. (1997).Introduction to Stochastic Programming, Springer, Verlag, New York.

[2]Benders, J.F. (1962). Partitioning Procedures for Solving Mixed Variables Programming Problems, Numerische Mathematik, 4(3):238-252. 

[3]Charnes, A. and Cooper, W. W. (1959). Chance-constrained Programming, Management Science, 6(1): 73-79.

[4]Defourny, B., Ernst, D. and Wehenkel, L.(2013).Multi-Stage Stochastic Programming: A Scenario Tree Based Approach to Planning Under Uncertainty, INFORMS Journal on Computing, 25(3): 488-501.

[5]Dantzig, G. B. and Wolfe, P. (1961). The Decomposition Algorithm for Linear Programming, Econometrica, 29(4):101-111.

[6]Higel, J.L., and Sen, S. (1999). Statistical Approximations for Stochastic Linear Programs, Ann. Oper. Res., 85(1): 173-192. 

[7]Higel, J.L. and Sen, S. (1991). An Algorithm for Two Stage Linear Programs with Recourse, Mathematics of Operations Research, 16(3): 650-669. 

[8]Kall,P.(1997). Stochastic Linear Programming, Springer.

[9]Mamer, J. W. and McBride, R. D. (2000). A Decomposition-based Pricing Procedure for Large-Scale Linear Programs: An application to the linear multi-commodity Flow Problem, 46(5), 693-709.

[10]Messina, E. and Mitra, G. (1997). Modeling and Analysis of Multi Stage Stochastic Programming Problems: A Software Environment, Eurp. J. Oper. Res., 101(2): 343-359. 

[11]Ravindran, A., Philips, D. T., and Solberg, J. J. (2005) .Operations Research: Principles and Practice.

[12]Slyke, R. V., and Wets, R. G. B. (1969). L-Shaped Programs with Applications to Control and Stochastic Programming, SIAM, J. on Applied Mathematics, 17 (4):638-663.

[13]Topologlu, H. and Powell, W. B. (2006). Dynamic Programming Approximations for Stochastic, Time-Staged Integer Multi-Commodity Flow Problems, 18(1):31-42. 

[14]Weiner A. and Khan, H. (1967). The Year 2000: A Framework for Speculation on the next Thirty Three years, Macmillan, New York.

[15]Winston, W.L. (1994).Linear Programming: Applications and Algorithm, Dunbury Press, Bellmont, California, U.S.A.

[16]Wallace, S.W. and Ziemba, W. T. (2005).Applications of Stochastic Programming, Society of Industrial and Applied Mathematics.