Multi-table Pivoting Algorithms for Solving Linear Bilevel Programming Problems
Xiaohui Lei · Yunchou yu guanli · 2010
Multi-table Pivoting Algorithms is a method based on pivoting algorithms for solving linear bilevel programming problems.By combination of tables,the method can also solve such problems as linear multilevel programming and linear bilevel multi-follower programming with independent followers(stackelberg-nash equilibrium).The algorithm's idea is to take advantage of pivoting algorithms by delivering constraints among multiple agents until the final equilibrium.Finally,an example shows that the method can reach its local optimum quickly and get global optimum if its inducible region is connected.