TY - JOUR
T1 - HIERARCHICAL DECENTRALIZED SYSTEMS AND ITS NEW SOLUTION BY A BARRIER METHOD.
AU - Aiyoshi, Eitaro
AU - Shimizu, Kiyotaka
PY - 1981
Y1 - 1981
N2 - Hierarchical optimization of the power-decentralized system, in which a central system and plural regional systems (subsystems) possess their own objective functions, is considered. The lower level consists of N regional systems each of which possesses its own decision variable vector, objective function, and constraint conditions. The central system in the higher level has the function of coordinating the regional systems through resource allocation, while the subsystems optimize their own objectives using given resources. The purpose of this study is to prescribe a new solution method for such a general resource allocation problem. A method is proposed in which a nonlinear programming problem approximating the original hierarchical one is solved iteratively by applying the penalty function method to the lower level problems. It is proved that a sequence of approximated solutions converges to the optimal solution. Some examples demonstrate the effectiveness of the proposed algorithm.
AB - Hierarchical optimization of the power-decentralized system, in which a central system and plural regional systems (subsystems) possess their own objective functions, is considered. The lower level consists of N regional systems each of which possesses its own decision variable vector, objective function, and constraint conditions. The central system in the higher level has the function of coordinating the regional systems through resource allocation, while the subsystems optimize their own objectives using given resources. The purpose of this study is to prescribe a new solution method for such a general resource allocation problem. A method is proposed in which a nonlinear programming problem approximating the original hierarchical one is solved iteratively by applying the penalty function method to the lower level problems. It is proved that a sequence of approximated solutions converges to the optimal solution. Some examples demonstrate the effectiveness of the proposed algorithm.
UR - http://www.scopus.com/inward/record.url?scp=0019583841&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0019583841&partnerID=8YFLogxK
U2 - 10.1109/tsmc.1981.4308712
DO - 10.1109/tsmc.1981.4308712
M3 - Article
AN - SCOPUS:0019583841
SN - 0018-9472
VL - SMC-11
SP - 444
EP - 449
JO - IEEE Transactions on Systems, Man and Cybernetics
JF - IEEE Transactions on Systems, Man and Cybernetics
IS - 6
ER -