Abstract
In this paper, we study alternative primal and dual formulations of multistage stochastic convex programs (SP). The alternative dual problems which can be traced to the alternative primal representations, lead to stochastic analogs of standard deterministic constructs such as conjugate functions and Lagrangians. One of the by-products of this approach is that the development does not depend on dynamic programming (DP) type recursive arguments, and is therefore applicable to problems in which the objective function is non-separable (in the DP sense). Moreover, the treatment allows us to handle both continuous and discrete random variables with equal ease. We also investigate properties of the expected value of perfect information (EVPI) within the context of SP, and the connection between EVPI and nonanticipativity of optimal multipliers. Our study reveals that there exist optimal multipliers that are nonanticipative if, and only if, the EVPI is zero. Finally, we provide interpretations of the retroactive nature of the dual multipliers.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Birge, J.R. (1982). “The Value of the Stochastic Solution in Stochastic Linear Programs with Fixed Recourse.” Mathematical Programming 24, 314–325.
Birge, J.R. (1985a). “Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs.” Operations Research 33, 989–1007.
Birge, J.R. (1985b). “Aggregation in Stochastic Linear Programs.” Mathematical Programming 31, 25–41.
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.
Clarke, F.H. (1983). Optimization and Nonsmooth Analysis, Wiley, New York.
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.
Frauendorfer, K. (1992). Stochastic Two-Stage Programming, Springer-Verlag, Berlin.
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.
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.
Rockafellar, R.T. and R. J.-B. Wets. (1976a). “Nonanticipativity and L 1 Martingales in Stochastic Optimization Problems.” Mathematical Programming Study 6, 170–187.
Rockafellar, R.T. and R. J.-B. Wets. (1976b). “Stochastic Convex Programming: Basic Duality.” Pacific J. of Mathematics 62, 173–195.
Rockafellar, R.T. and R. J.-B. Wets. (1982). “On the Interchange of Subdifferentiation and Conditional Expectation for Convex Functionals. Stochastics 7, 173–182.
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.
Ross, S.M. (1996). Stochastic Processes, 2nd 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.
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.
Zipkin, P. (1980). “Bounds for Row Aggregation in Linear Programming.” Operations Research 28, 903–918.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by NSF grant DMII-9414680.
Rights and permissions
About this article
Cite this article
Higle, J.L., Sen, S. Multistage stochastic convex programs: Duality and its implications. Ann Oper Res 142, 129–146 (2006). https://doi.org/10.1007/s10479-006-6165-z
Issue Date:
DOI: https://doi.org/10.1007/s10479-006-6165-z