Article ID: | iaor2017657 |
Volume: | 64 |
Issue: | 6 |
Start Page Number: | 1239 |
End Page Number: | 1255 |
Publication Date: | Dec 2016 |
Journal: | Operations Research |
Authors: | Giesecke Kay, Sirignano Justin A, Tsoukalas Gerry |
Keywords: | investment, combinatorial optimization, simulation, programming: integer, heuristics |
We consider the problem of optimally selecting a large portfolio of risky loans, such as mortgages, credit cards, auto loans, student loans, or business loans. Examples include loan portfolios held by financial institutions and fixed‐income investors as well as pools of loans backing mortgage‐ and asset‐backed securities. The size of these portfolios can range from the thousands to even hundreds of thousands. Optimal portfolio selection requires the solution of a high‐dimensional nonlinear integer program and is extremely computationally challenging. For larger portfolios, this optimization problem is intractable. We propose an approximate optimization approach that yields an asymptotically optimal portfolio for a broad class of data‐driven models of loan delinquency and prepayment. We prove that the asymptotically optimal portfolio converges to the optimal portfolio as the portfolio size grows large. Numerical case studies using actual loan data demonstrate its computational efficiency. The asymptotically optimal portfolio’s computational cost does not increase with the size of the portfolio. It is typically many orders of magnitude faster than nonlinear integer program solvers while also being highly accurate even for moderate‐sized portfolios.