Optimal Solutions for a Class of Set-Valued Evolution Problems

Abstract

The paper is concerned with a class of optimization problems for moving sets t(t)⊂R2, motivated by the control of invasive biological populations. Assuming that the initial contaminated set 0 is convex, we prove that a strategy is optimal if an only if at each given time t∈ [0,T] the control is active along the portion of the boundary ∂ (t) where the curvature is maximal. In particular, this implies that (t) is convex for all t≥ 0. The proof relies on the analysis of a one-step constrained optimization problem, obtained by a time discretization.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…