David P. Morton
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
David P. Morton has a total of 160 co-authors. Here are the top co-authors by number of shared publications:
- Bismark Singh
School of Mathematical Sciences University of Southampton Southampton UK
8 shared publications Elmira Popova
8 shared publications- Lauren Ancel Meyers
Department of Integrative Biology, The University of Texas at Austin, Austin, Texas, United States of America
8 shared publications Ernie Kee
YK.risk, LLC, Bay City, TX
6 shared publicationsJ. R. Howell
Department of Mechanical Engineering, The University of Texas at Austin
6 shared publicationsK. J. Daun
Department of Mechanical Engineering, The University of Texas at Austin
6 shared publications
Latest Publications
- Open Access
- 5 June 2026
- Published by Springer Nature in Mathematical Programming
- Vol. 217 (1-2) , 43-78
MDP modeling for multi-stage stochastic programs
We study a class of multi-stage stochastic programs, which incorporate modeling features from Markov decision processes (MDPs). This class includes structured MDPs with continuous action and state spaces. We extend policy graphs to include decision-dependent uncertainty for one-step transition probabilities as well as a limited form of statistical learning. We focus on the expressiveness of our modeling approach, illustrating ideas with a series of examples of increasing complexity. As a solution method, we develop new variants of stochastic dual dynamic programming, including approximations to handle non-convexities.
- 5 June 2026
- Published by Springer Nature in Mathematical Programming
- Vol. 217 (1-2) , 43-78
Open AccessMDP modeling for multi-stage stochastic programs
We study a class of multi-stage stochastic programs, which incorporate modeling features from Markov decision processes (MDPs). This class includes structured MDPs with continuous action and state spaces. We extend policy graphs to include decision-dependent uncertainty for one-step transition probabilities as well as a limited form of statistical learning. We focus on the expressiveness of our modeling approach, illustrating ideas with a series of examples of increasing complexity. As a solution method, we develop new variants of stochastic dual dynamic programming, including approximations to handle non-convexities.
- 14 May 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 34 (2) , 1755-1783
Pragmatic Distributionally Robust Optimization for Simple Integer Recourse Models
Inspired by its success for their continuous counterparts, the standard approach to deal with mixed-integer recourse (MIR) models under distributional uncertainty is to use distributionally robust optimization (DRO). We argue, however, that this modeling choice is not always justified since DRO techniques are generally computationally challenging when integer decision variables are involved. That is why we propose an alternative approach for dealing with distributional uncertainty for the special case of simple integer recourse (SIR) models, which is aimed at obtaining models with improved computational tractability. We show that such models can be obtained by pragmatically selecting the uncertainty set. Here, we consider uncertainty sets based on the Wasserstein distance and also on generalized moment conditions. We compare our approach with standard DRO both numerically and theoretically. An important side result of our analysis is the derivation of performance guarantees for convex approximations of SIR models. In contrast to the literature, these error bounds are not only valid for a continuous distribution but hold for any distribution.
- 14 May 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 34 (2) , 1755-1783
Pragmatic Distributionally Robust Optimization for Simple Integer Recourse Models
Inspired by its success for their continuous counterparts, the standard approach to deal with mixed-integer recourse (MIR) models under distributional uncertainty is to use distributionally robust optimization (DRO). We argue, however, that this modeling choice is not always justified since DRO techniques are generally computationally challenging when integer decision variables are involved. That is why we propose an alternative approach for dealing with distributional uncertainty for the special case of simple integer recourse (SIR) models, which is aimed at obtaining models with improved computational tractability. We show that such models can be obtained by pragmatically selecting the uncertainty set. Here, we consider uncertainty sets based on the Wasserstein distance and also on generalized moment conditions. We compare our approach with standard DRO both numerically and theoretically. An important side result of our analysis is the derivation of performance guarantees for convex approximations of SIR models. In contrast to the literature, these error bounds are not only valid for a continuous distribution but hold for any distribution.
- 3 November 2022
- Published by Elsevier in Finance Research Letters
- Vol. 51
Efficient portfolios computed with moment-based bounds
- 3 November 2022
- Published by Elsevier in Finance Research Letters
- Vol. 51
Efficient portfolios computed with moment-based bounds
- 10 October 2022
- Published by Elsevier in Applied Energy
- Vol. 326
Dispatch optimization of a concentrating solar power system under uncertain solar irradiance and energy prices
- 10 October 2022
- Published by Elsevier in Applied Energy
- Vol. 326
Dispatch optimization of a concentrating solar power system under uncertain solar irradiance and energy prices
- 26 September 2022
- Published by Springer Nature in Annals of Operations Research
- Vol. 348 (2) , 807-831
Incorporating convex risk measures into multistage stochastic programming algorithms
- 26 September 2022
- Published by Springer Nature in Annals of Operations Research
- Vol. 348 (2) , 807-831
Incorporating convex risk measures into multistage stochastic programming algorithms
- 4 August 2022
- Published by Springer Nature in Mathematical Programming
- Vol. 196 (1-2) , 907-933
Bi-objective multistage stochastic linear programming
- 4 August 2022
- Published by Springer Nature in Mathematical Programming
- Vol. 196 (1-2) , 907-933
Bi-objective multistage stochastic linear programming
- 13 July 2022
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 32 (3) , 1499-1522
Distributionally Robust Two-Stage Stochastic Programming
Distributionally robust optimization is a popular modeling paradigm in which the underlying distribution of the random parameters in a stochastic optimization model is unknown. Therefore, hedging a...
- 13 July 2022
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 32 (3) , 1499-1522
Distributionally Robust Two-Stage Stochastic Programming
Distributionally robust optimization is a popular modeling paradigm in which the underlying distribution of the random parameters in a stochastic optimization model is unknown. Therefore, hedging a...
- 4 March 2022
- Published by Taylor & Francis in IISE Transactions
- Vol. 54 (10) , 936-949
Optimizing diesel fuel supply chain operations to mitigate power outages for hurricane relief
Hurricanes can cause severe property damage and casualties in coastal regions. Diesel fuel plays a crucial role in hurricane disaster relief. It is important to optimize fuel supply chain operations so that emergency diesel fuel demand for power generation in a hurricane’s immediate aftermath can be mitigated. It can be challenging to estimate diesel fuel demand and make informed decisions in the distribution process, accounting for the hurricane’s path and severity. We develop predictive and prescriptive models to guide diesel fuel supply chain operations for hurricane disaster relief. We estimate diesel fuel demand from historical weather forecasts and power outage data. This predictive model feeds a prescriptive stochastic programming model implemented in a rolling-horizon fashion to dispatch tank trucks. This data-driven optimization tool provides a framework for decision support in preparation for approaching hurricanes, and our numerical results provide insights regarding key aspects of operations.
- 4 March 2022
- Published by Taylor & Francis in IISE Transactions
- Vol. 54 (10) , 936-949
Optimizing diesel fuel supply chain operations to mitigate power outages for hurricane relief
Hurricanes can cause severe property damage and casualties in coastal regions. Diesel fuel plays a crucial role in hurricane disaster relief. It is important to optimize fuel supply chain operations so that emergency diesel fuel demand for power generation in a hurricane’s immediate aftermath can be mitigated. It can be challenging to estimate diesel fuel demand and make informed decisions in the distribution process, accounting for the hurricane’s path and severity. We develop predictive and prescriptive models to guide diesel fuel supply chain operations for hurricane disaster relief. We estimate diesel fuel demand from historical weather forecasts and power outage data. This predictive model feeds a prescriptive stochastic programming model implemented in a rolling-horizon fashion to dispatch tank trucks. This data-driven optimization tool provides a framework for decision support in preparation for approaching hurricanes, and our numerical results provide insights regarding key aspects of operations.
- 6 January 2022
- Published by Springer Nature in Mathematical Programming
- Vol. 191 (1) , 1-5
Special Issue: Topics in Stochastic Programming
- 6 January 2022
- Published by Springer Nature in Mathematical Programming
- Vol. 191 (1) , 1-5
Special Issue: Topics in Stochastic Programming
- 29 June 2021
- Published by Springer Nature in Mathematical Programming
- Vol. 194 (1-2) , 1113-1162
Optimal crashing of an activity network with disruptions
- 29 June 2021
- Published by Springer Nature in Mathematical Programming
- Vol. 194 (1-2) , 1113-1162
Optimal crashing of an activity network with disruptions