Multi-Table Pivoting Algorithms for Solving Linear Multi-Level Programming Problems

Multi-table Pivoting Algorithms is a method based on pivoting algorithms for solving linear bi-level programming problems.By combination of tables,the method can also solve similar problems such as linear multi-level programming and linear bi-level multi-follower programming (stackelberg-nash equilibrium),and so on. Algorithm´s idea is to make use of pivoting algorithms by delivering constraint between decision-makers,at last to obtain optimal solution.Finally,an example shows that the method can reach its optimal point quickly.