“…Clearly, in this framework for any fixed t ∈ [0, 1] one has a static case problem. This approach is well known and well studied in the literature, both as a pointwise study (see for instance [6,7,18,24] and references therein), or as a numerical method and for designing algorithms (see for example [3,4,11,14,15]). In this paper, instead of looking at the sets S(t), we focus on solution trajectories, functions like x : [0, 1] → R n such that x(t) ∈ S(t), for all t ∈ [0, 1], that is, x(•) is a selection for S over [0, 1].…”