Dynamic stochastic programmingfor asset-liability management

被引:105
作者
G. Consigli
M. A. H. Dempster
机构
关键词
Stochastic Programming; Interior Point Method; Dynamic Stochastic Programming; Terminal Wealth; Portfolio Problem;
D O I
10.1023/A:1018992620909
中图分类号
学科分类号
摘要
Multistage stochastic programming - in contrast to stochastic control - has found wideapplication in the formulation and solution of financial problems characterized by a largenumber of state variables and a generally low number of possible decision stages. Theliterature on the use of multistage recourse modelling to formalize complex portfolio optimizationproblems dates back to the early seventies, when the technique was first adopted tosolve a fixed income security portfolio problem. We present here the CALM model, whichhas been designed to deal with uncertainty affecting both assets (in either the portfolio orthe market) and liabilities (in the form of scenario dependent payments or borrowing costs).We consider as an instance a pension fund problem in which portfolio rebalancing is allowedover a long-term horizon at discrete time points and where liabilities refer to five differentclasses of pension contracts. The portfolio manager, given an initial wealth, seeks the maximizationof terminal wealth at the horizon, with investment returns modelled as discretestate random vectors. Decision vectors represent possible investments in the market andholding or selling assets in the portfolio, as well as borrowing decisions from a credit lineor deposits with a bank. Computational results are presented for a set of 10-stage portfolioproblems using different solution methods and libraries (OSL, CPLEX, OB1). The portfolioproblem, with an underlying vector data process which allows up to 2688 realizations at the10-year horizon, is solved on an IBM RS6000y590 for a set of twenty-four large-scale testproblems using the simplex and barrier methods provided by CPLEX (the latter for eitherlinear or quadratic objective), the predictorycorrector interior point method provided in OB1,the simplex method of OSL, the MSLiP-OSL code instantiating nested Benders decompositionwith subproblem solution using OSL simplex, and the current version of MSLiP.
引用
收藏
页码:131 / 162
页数:31
相关论文
共 54 条
  • [1] Adler I.(1989)An implementation of Karmarkar's algorithm for linear programming Mathematical Programming 44 297-335
  • [2] Karmarkar N.K.(1962)Partitioning procedures for solving mixed-variables programming problems Numerische Mathematik 4 238-252
  • [3] Resende M.G.C.(1985)Decomposition and partitioning methods for multistage stochastic linear programs Operations Research 33 989-1007
  • [4] Veiga G.(1987)A standard input format for multiperiod stochastic linear programs, Mathematical Programming Society Committee on Algorithms Newsletter 17 1-20
  • [5] Benders J.F.(1972)A dynamic model for bond portfolio management Management Science 19 139-151
  • [6] Birge J.R.(1994)The Russell –Yasuda Kasai model: An assetyliability model for a Japanese insurance company using multistage stochastic programming Interfaces 24 29-49
  • [7] Birge J.R.(1993)Multi-stage stochastic linear programs for portfolio optimization Annals of Operations Research 45 59-76
  • [8] Dempster M.A.H.(1988)On stochastic programming: II. Dynamic problems under risk Stochastics 25 15-42
  • [9] Gassmann H.I.(1991)Object oriented model integration in a financial decision support system Decision Support Systems 7 329-340
  • [10] Gunn E.A.(1995)Multistage stochastic programs: The state-of-the-art and selected bibliography Kybernetika 31 151-174