摘要
在本文中 ,我们研究斯坦伯格问题 。
In this paper, we study linear static Stac kelberg problems with multiple leaders-followers in which each decision maker wi thin his group may or may not cooperate. An exact penalty function method is dev eloped. The duality gaps of the followers’ problems are appended to the leaders’ objective function with a penalty. The structure leads to the decomposition of the composite problem into a series of linear programmings leading to an efficie nt algorithm. We prove that local optimality is reached for an exact penalty fun ction and illustrate the method with three examples. The model in this paper ext ends the stackelberg leader-follower model.
