# Dynamic stochastic programmingfor asset-liability management

*G. Consigli* and
*M. Dempster*

*Annals of Operations Research*, 1998, vol. 81, issue 0, 162 pages

**Abstract:**
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. Copyright Kluwer Academic Publishers 1998

**Date:** 1998

**References:** Add references at CitEc

**Citations:** View citations in EconPapers (26) Track citations by RSS feed

**Downloads:** (external link)

http://hdl.handle.net/10.1023/A:1018992620909 (text/html)

Access to full text is restricted to subscribers.

**Related works:**

This item may be available elsewhere in EconPapers: Search for items with the same title.

**Export reference:** BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text

**Persistent link:** https://EconPapers.repec.org/RePEc:spr:annopr:v:81:y:1998:i:0:p:131-162:10.1023/a:1018992620909

**Ordering information:** This journal article can be ordered from

http://www.springer.com/journal/10479

**DOI:** 10.1023/A:1018992620909

Access Statistics for this article

Annals of Operations Research is currently edited by *Endre Boros*

More articles in Annals of Operations Research from Springer

Bibliographic data for series maintained by Sonal Shukla ().