Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Extended scenario analysis

  • 136 Accesses

  • 13 Citations

Abstract

Scenario analysis, as proposed by Rockafellar and Wets, is a stochastic programming technique employing discrete scenarios with known probabilities, usually covering several time periods. The requirement of nonaticipativity (not using future information to make present decisions) is enforced during the computational solution by using Spingarn's method of partial inverses. The scenario analysis method as proposed relies on separability (with respect to scenarios) of all problem elements except the nonanticipativity constraint.

We show how, by making a little more use of the partial inverse technique, one can include nonseparable convex constraints in such a procedure. As an illustrative example, we show how to analyze a portfolio optimization problem of Markowitz type (minimize variance for a given return) using scenarios. This offers the prospect of extending classical portfolio analysis from models based on historical behavior to models incorporating future scenarios of any desired type.

This is a preview of subscription content, log in to check access.

References

  1. [1]

    R.A. Haugen,Modern Investment Theory (Prentice-Hall, 1986).

  2. [2]

    H.M. Markowitz,Portfolio Selection: Efficient Diversification of Investments (Yale University Press, 1959).

  3. [3]

    J.M. Mulvey and H. Vladimirou, Solving multistage stochastic networks: An application of scenario aggregation, Report SOR-88-1, Department of Civil Engineering and Operations Research, Princeton University (Revised July 1989).

  4. [4]

    J.M. Mulvey and H. Vladimirou, Stochastic network optimization models for investment planning, Report SOR-88-2. Department of Civil Engineering and Operations Research, Princeton University (September 1988).

  5. [5]

    J.M. Mulvey and H. Vladimirou, Evaluation of a distributed hedging algorithm for stochastic network programming, Technical Report SOR-88-14, Department of Civil Engineering and Operations Research, Princeton University (November 1988).

  6. [6]

    R.T. Rockafellar,Convex Analysis (Princeton University Press, 1970).

  7. [7]

    R.T. Rockafellar, Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math. Oper. Res. 1 (1976) 97–116.

  8. [8]

    R.T. Rockafellar, Monotone operators and the proximal point algorithm, SIAM J. Control Optim. 14 (1976) 877–898.

  9. [9]

    R.T. Rockafellar and R. J.-B. Wets, Scenarios and policy aggregation in optimization under uncertainty. Working Paper WP-87-119, International Institute for Applied Systems Analysis, Laxenburg, Austria (December 1987), forthcoming in Math. Oper. Res.

  10. [10]

    J. Spingarn, Partial inverse of a monotone operator, Appl. Math. Optim. 10 (1983) 247–265.

  11. [11]

    R. J.-B. Wets, The aggregation principle in scenario analysis and stochastic optimization, Working paper, Department of Mathematics, University of California-Davis (undated).

Download references

Author information

Additional information

The research reported here was sponsored by the National Science Foundation under Grant CCR-8801489, and by the Air Force Systems Command, USAF, under Grant No. AFOSR-89-0058. The US Government has certain rights in this material, and is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Robinson, S.M. Extended scenario analysis. Ann Oper Res 31, 385–397 (1991). https://doi.org/10.1007/BF02204859

Download citation

Keywords

  • Scenario analysis
  • partial inverse
  • resolvent iteration
  • proximal point iteration
  • monotone sum problem
  • portfolio optimization