On Efficient Management of Complex Systems
by Victor Korotkikh and Galina Korotkikh
Abstract: Complex systems profoundly change human activities of the day. However,it is still unknown how to deal with complex systems efficiently without confronting NP-hard problems. Existing concepts of complexity are very important on many occasions, but they do not explain how the performance of a system is dependent on its complexity and whether efficient
management of complex systems may be possible at all.
In the talk we present a concept of complexity based on self-organization processes of prime integer relations, called the structural complexity
. By computational experiments we investigate whether the performance of
an optimisation algorithm for a NP-hard problem could behave as a concave function of the algorithm's structural complexity
. The results of the
experiments offer the possibility of a general optimality condition of complex systems: a complex system demonstrates the optimal performance for a problem, if the structural complexity of the system is in a certain relationship with the structural complexity of the problem.
For More Information: Mark Fackrell: email@example.com