Dynamic-programming approaches to single-and multi-stage stochastic knapsack problems for portfolio optimization
Abstract
This thesis proposes new methods, based on dynamic programming, for solving certain single-stage and multi-stage integer stochastic knapsack problems. These problems model stochastic portfolio optimization problems (SPOPs) which assume deterministic unit weight, and normally distributed unit return with known mean and variance for each item type. Given an initial wealth, the objective is to select a portfolio that maximizes the probability of achieving or exceeding a specified final return threshold; the multi-stage problem allows revisions of the portfolio at regular time intervals. An exact method is developed to solve a single-stage SPOP with independence of returns among item types. For a problem from the literature with 11 item types, this method obtains an optimal solution in a fraction of a second on a laptop computer. An approximation method, based on discretization of possible wealth values, is developed to solve a multi-stage SPOP with inter- and intra-stage independence of returns among item types. Running on a desktop computer, this approximation method solves a 3-stage problem with 6 item types in under 12 minutes. With finer discretization in a 3-stage problem with 8 item types, the solution time is about 46 minutes.
Collections
Related items
Showing items related by title, author, creator and subject.
-
Calculating CVaR and bPOE for Common Probability Distributions With Application to Portfolio Optimization and Density Estimation
Norton, Matthew; Khokhlov, Valentyn; Uryasev, Stan (Springer, 2019-10);Conditional value-at-risk (CVaR) and value-at-risk, also called the superquantile and quan- tile, are frequently used to characterize the tails of probability distributions and are popular measures of risk in applications ... -
Cybersecurity, Artificial Intelligence, and Risk Management: Understanding Their Implementation in Military Systems Acquisitions
Mun, Johnathan; Housel, Thomas (Monterey, California. Naval Postgraduate School, 2022-05-02); SYM-AM-22-065This research has the explicit goal of proposing a reusable, extensible, adaptable, and comprehensive advanced analytical modeling process to help the U.S. Navy in quantifying, modeling, valuing, and optimizing a set of ... -
Cybersecurity, Artificial Intelligence, and Risk Management: Understanding Their Implementation in Military Systems Acquisitions
Mun, Johnathan; Housel, Thomas (Monterey, California. Naval Postgraduate School, 2022-05-02); SYM-AM-22-065This research has the explicit goal of proposing a reusable, extensible, adaptable, and comprehensive advanced analytical modeling process to help the U.S. Navy in quantifying, modeling, valuing, and optimizing a set of ...