Multistage stochastic convex programs: Duality and its implications

• Birge, J.R. (1982). “The Value of the Stochastic Solution in Stochastic Linear Programs with Fixed Recourse.” Mathematical Programming 24, 314–325.

  Article  Google Scholar 

• Birge, J.R. (1985a). “Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs.” Operations Research 33, 989–1007.

  Google Scholar 

• Birge, J.R. (1985b). “Aggregation in Stochastic Linear Programs.” Mathematical Programming 31, 25–41.

  Google Scholar 

• Cariño, D.R., T. Kent, D.H. Myers, C. Stacy, M. Sylvanus, A. Turner, K. Watanabe, and W.T. Ziemba. (1994). “The Russel-Yasuda Kasai Model: an Asset/liability Model for a Japanese Insurance Company Using Multistage Stochastic Programming.” Interfaces 24, 29–49.

  Google Scholar 

• Clarke, F.H. (1983). Optimization and Nonsmooth Analysis, Wiley, New York.

  Google Scholar 

• Dempster, M.A.H. (1981). “The Expected Value of Perfect Information in the Optimal Evolution of Stochastic Systems.” Stochastic Differential Systems, M. Arato, E. Vermes, and A.V. Balakrishnan (eds.), Lecture Notes in Information and Control 36, Springer, Berlin, 25–40.

• Dempster, M.A.H. (1988). “On Stochastic Programming II: Dynamic Problems Under Risk.” Stochastics 25, 15–42.

  Google Scholar 

• Frauendorfer, K. (1992). Stochastic Two-Stage Programming, Springer-Verlag, Berlin.

  Google Scholar 

• Frauendorfer, K. (1996). “Barycentric Scenario Trees in Convex Multistage Stochastic Programming.” Mathematical Programming (Series B), 75, 277–294.

• Higle, J.L. and S. Sen. (1996a). Stochastic Decomposition: A Statistical Method for Large Scale Stochastic Linear Programming, Kluwer Academic Publishers, Dordrecht.

  Google Scholar 

• Higle, J.L. and S. Sen. (1996b). “Duality and Statistical Tests of Optimality for Two Stage Stochastic Prgorams.” Mathematical Programming (Series B) 75, 257–275.

• Mulvey, J.M. and A. Ruszczyński. (1995). “A New Scenario Decomposition Method for Large Scale Stochastic Optimization.” Operations Research 43, 477–490.

  Google Scholar 

• Rockafellar, R.T. and R. J.-B. Wets. (1976a). “Nonanticipativity and L ¹ Martingales in Stochastic Optimization Problems.” Mathematical Programming Study 6, 170–187.

  Google Scholar 

• Rockafellar, R.T. and R. J.-B. Wets. (1976b). “Stochastic Convex Programming: Basic Duality.” Pacific J. of Mathematics 62, 173–195.

  Google Scholar 

• Rockafellar, R.T. and R. J.-B. Wets. (1982). “On the Interchange of Subdifferentiation and Conditional Expectation for Convex Functionals. Stochastics 7, 173–182.

  Google Scholar 

• Rockafellar, R.T. and R. J.-B. Wets. (1991). “Scenarios and Policy Aggregation in Optimization Under Uncertainty.” Math. of Oper. Res. 16 119–147.

• Rockafellar, R.T. and R. J.-B. Wets. (1992). “A Dual Strategy for the Implementation of the Aggregation Principle in Decision Making Under Uncertainty.” Applied Stochastic Models and Data Analysis 8, 245–255.

  Google Scholar 

• Ross, S.M. (1996). Stochastic Processes, 2^nd ed., John Wiley and Sons.

• Sen, S., R.D. Doverspike, and S.C. Cosares. (1994). “Network Planning with Random Demand.” Telecommunications Systems 3, 11–30.

  Article  Google Scholar 

• Wets, R. J.-B. (1975). On the Relation Between Stochastic and Deterministic Optimization, in: A. Bensoussan and J.L. Lions (eds.), Control Theory, Numerical Methods and Computer Systems Modeling, Lecture Notes in Economics and Mathematical Systems, 107, 350–361.

• Wets, R. J.-B. (1989). Stochastic Programming, in: G.L. Nemhauser, A.H.G. Rinooy Kan and M.J. Todd (eds.) Handbooks in Operations Research: Optimization, 573–629, North-Holland, Amsterdam.

• Wright, S.E. (1994). “Primal-dual Aggregation and Disaggregation for Stochastic Linear Programs.” Math. of Oper. Res. 19, 893–908.

  Article  Google Scholar 

• Zipkin, P. (1980). “Bounds for Row Aggregation in Linear Programming.” Operations Research 28, 903–918.

  Google Scholar 

Download references