KT Condition and the penalty function are used to turn linear three level programming problem into bilevel programming problem whose constraint conditions are linear. Then by using Frank-Wolf linear approximation theory, we obtain the optimal solution of the linear three level programming problem by solving linear programming. The principal pivot simplex method is used to solve linear programming. Its merit is to obtain the feasible solution which is to approach the optimal point, thus reduces the amount of computation.