Transactions of the Institute of Systems, Control and Information Engineers
Online ISSN : 2185-811X
Print ISSN : 1342-5668
ISSN-L : 1342-5668
Overlapping Coordination Methodology Using Nonfeasible Decompositions
Takashi SHIMA
Author information

1989 Volume 2 Issue 11 Pages 377-389


We will focus on computational aspects of hierarchical overlapping coordination, the concept of which was first introduced in Haimes and Macko, and propose new coordination methodology in this paper.
The overlapping coordination formulated mathematically by Macko and Haimes as the optimization methodology for large scale systems is a feasible decomposition method in the sense that every constraint is satisfied during the optimization process.
Here, we will develop a new overlapping coordination method which uses a non-feasible decomposition method. The Kuhn-Tucker or Lagrange multipliers for the coupling constraints of different decompositions are used as the coordination variables. The coupling constraints may not be satisfied, untill the optimal solution is found.
Numerical examples will be solved in order to show how the proposed method works and the results show that it is very promising. The proposed method keeping the attributes of overlapping coordination concepts can be applied effectively for many types of real large scale problems.

Information related to the author
© The Institute of Systems, Control and Information Engineers
Previous article Next article