The most critical problem of viability theory is determining the initial states of a dynamical system for which at least one solution remains in the same set. This problem is analogous to many real situations, particularly management problems modelled as high-dimensional dynamic systems. However, the high dimensionality hampers the practical utility of the theory. The existing literature reports difficulties with models of more than four dimensions. Therefore, we investigate the current algorithms and study a calculation formula for high-dimensional linear and convex problems. We found a formula for viable sets in case of backward invariance of the environment set. Finally, since many dynamical systems are neither convex nor linear, extending our work to such systems is the immediate challenge.