Abstract

Abstract In this article, the authors present a method for the decomposition of complex problems which uses as coordination magnitudes the variables of interconnection between subsystems and the associated Lagrangian parameters. This method thus uses a combined coordination by simultaneous action on the criterion function and on the model of each subsystem. The principles of the method are discussed along with static and dynamic optimization problems while defining the local lower-level optimization subproblems, proposing coordinating algorithms for the higher level, and presenting the con vergence studies relative to these algorithms.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call