Least Squares Monte Carlo and Approximate Linear Programming: Error Bounds and Energy Real Option Application

Least squares Monte Carlo (LSM) is an approximate dynamic programming (ADP) technique commonly used for the valuation of high dimensional financial and real options, but has broader applicability. It is known that the regress-later version of this method is an approximate linear programming (ALP) relaxation that implicitly provides a potential solution to a familiar ALP deficiency. Focusing on a generic finite horizon Markov decision process, we provide both theoretical and numerical backing for the usefulness of this solution, respectively using a worst-case error bound analysis and a numerical study dealing with merchant ethanol production, an energy real option application, based on an ALP heuristic that we propose. When both methodologies are applicable, our research supports the use of regress-later LSM rather than this ALP technique to approximately solve intractable Markov decision processes. Our numerical findings motivate additional research to obtain even better methods than the regress-later version of LSM.