Reduction method for functional nonconvex differential inclusions

Our aim in this paper is to present a reduction method that solves first order functional differential inclusion in the nonconvex case. This approach is based on a discretization of the time interval, a construction of approximate solutions by reducing the problem to a problem without delay and an application of known results in this case. We generalises earlier results, the right hand side of the inclusion has nonconvex values and satisfies a linear growth condition instead to be integrably bounded. The lack of convexity is replaced by the topological properties of decomposable sets, that represents a good alternative in the absence of convexity.