Approximate Solutions to Retirement Spending Problems and The Optimality of Ruin
نویسندگان
چکیده
Milevsky and Huang (2011) investigated the optimal retirement spending policy for a utility-maximizing retiree facing a stochastic lifetime but assuming deterministic investment returns. They solved the problem using techniques from the calculus of variations and derived analytic expressions for the optimal spending rate and wealth depletion time under the Gompertz law of mortality. Of course, in the real world financial returns are stochastic as well as lifetimes, raising the question of whether their qualitative insights and approximations are generalizable or practical. We solve the retirement income problem when investment returns are indeed stochastic using numerical PDE methods, assuming the principles of stochastic control theory and dynamic programming. But then – and this is key – we compare the proper optimal spending rates to the analytic approach presented in Milevsky and Huang (2011) by updating the portfolio wealth inputs to current market values. Our main practical conclusion is that this simplistic approximation when calibrated properly and frequently can indeed be used as an accurate guide for rational retirement spending policy. As a by-product of our PDE-based methodology, our results indicate that even though the wealth depletion time is no longer a certainty under stochastic returns, the expected age at which liquid wealth is exhausted (i.) takes place well before the maximum lifetime and (ii.) is also well approximated by our analytical solution.
منابع مشابه
Optimality conditions for approximate solutions of vector optimization problems with variable ordering structures
We consider nonconvex vector optimization problems with variable ordering structures in Banach spaces. Under certain boundedness and continuity properties we present necessary conditions for approximate solutions of these problems. Using a generic approach to subdifferentials we derive necessary conditions for approximate minimizers and approximately minimal solutions of vector optimizatio...
متن کاملSequential Optimality Conditions and Variational Inequalities
In recent years, sequential optimality conditions are frequently used for convergence of iterative methods to solve nonlinear constrained optimization problems. The sequential optimality conditions do not require any of the constraint qualications. In this paper, We present the necessary sequential complementary approximate Karush Kuhn Tucker (CAKKT) condition for a point to be a solution of a ...
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملMinimizing the Probability of Ruin in Retirement
Retirees who exhaust their savings while still alive are said to experience financial ruin. The savings are typically grown during life’s accumulation phase then spent during the retirement decumulation phase. Extensive research into invest-and-harvest decumulation strategies has been conducted, but recommendations differ markedly. This has likely been a source of concern and confusion for the ...
متن کاملOn Approximate Stationary Radial Solutions for a Class of Boundary Value Problems Arising in Epitaxial Growth Theory
In this paper, we consider a non-self-adjoint, singular, nonlinear fourth order boundary value problem which arises in the theory of epitaxial growth. It is possible to reduce the fourth order equation to a singular boundary value problem of second order given by w''-1/r w'=w^2/(2r^2 )+1/2 λ r^2. The problem depends on the parameter λ and admits multiple solutions. Therefore, it is difficult to...
متن کامل