A viability algorithm (Q685787)

Consider the differential inclusion \((*)\) \(x'(t)\in F(t,x(t))\), where \(F\) is a given multifunction with values in finite dimensional space. A set \(K\) is called a viability set for \((*)\) if for every \(x_ 0\in K\) there exists a solution of \((*)\) starting from \(x_ 0\) which remains in \(K\). If \(K\) is not a viability set one can look for a smaller (resp. largest) viability set contained in \(K\). In this paper, supposing that \(F\) is an upper semicontinuous compact convex valued multifunction and \(K\) is a compact set, the authors define an algorithm to provide a viability subset of \(K\).