Abstract
This paper demonstrates how the well-known discrete life-cycle consumption problem (LCP) can be solved using the Robust Counterpart (RC) formulation technique, as defined in Ben-Tal and Nemirovski (Math Oper Res 23(4):769–805, 1998). To do this, we propose a methodology that involves applying a change of variables over the original consumption before deriving the RC. These transformations allow deriving a closed solution to the inner problem, and thus to solve the LCP without facing the curse of dimensionality and without needing to specify the prior distribution for the investment opportunity set. We generalize the methodology and illustrate how it can be used to solve other type of problems. The results show that our methodology enables solving long-term instances of the LCP (30 years). We also show it provides an alternative consumption pattern as to the one provided by a benchmark that uses a dynamic programming approach. Rather than finding a consumption that maximizes the expected lifetime utility, our solution delivers higher utilities for worst-case scenarios of future returns.
| Original language | English |
|---|---|
| Pages (from-to) | 481-499 |
| Number of pages | 19 |
| Journal | Computational Economics |
| Volume | 57 |
| Issue number | 2 |
| DOIs | |
| State | Published - Feb 2021 |
| Externally published | Yes |
Keywords
- Intertemporal portfolio-choice problem
- Life-cycle consumption problem
- Robust counterpart framework
- Robust optimization