Related Experiment Video
Updated: Jul 25, 2025

Setup of Consumer Wearable Devices for Exposure and Health Monitoring in Population Studies
Published on: February 3, 2023
A simple planning problem for COVID-19 lockdown: a dynamic programming approach
Alessandro Calvia1, Fausto Gozzi1, Francesco Lippi1,2
1Dipartimento di Economia e Finanza, LUISS University, Viale Romania 32, 00197 Rome, Italy.
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.
Related Concept Videos
Statically Indeterminate Problem Solving
Principle of Virtual Work: Problem Solving
To apply the principle of virtual work,...
Steps in Outbreak Investigation
Distributed Loads: Problem Solving
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Principle of Moments: Problem Solving
One such scenario involves a pole placed in a three-dimensional system with a cable attached. When a tension is applied to the cable, the moment about the z-axis passing through...

