A simple planning problem for COVID-19 lockdown: a dynamic programming approach
From MaRDI portal
Publication:6131950
Abstract: A large number of recent studies consider a compartmental SIR model to study optimal control policies aimed at containing the diffusion of COVID-19 while minimizing the economic costs of preventive measures. Such problems are non-convex and standard results need not to hold. We use a Dynamic Programming approach and prove some continuity properties of the value function of the associated optimization problem. We study the corresponding Hamilton-Jacobi-Bellman equation and show that the value function solves it in the viscosity sense. Finally, we discuss some optimality conditions. Our paper represents a first contribution towards a complete analysis of non-convex dynamic optimization problems, within a Dynamic Programming approach.
Recommendations
- An optimal control problem for virus propagation and economic loss
- The optimal lockdown intensity for COVID-19
- Optimal control of an SIR epidemic through finite-time non-pharmaceutical intervention
- SIR epidemics with state-dependent costs and ICU constraints: a Hamilton-Jacobi verification argument and dual LP algorithms
- Optimal switching between locking down and opening the economy because of an infection
This page was built for publication: A simple planning problem for COVID-19 lockdown: a dynamic programming approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6131950)