The algorithm called linear efficiency coefficient for cooperative games within each team in multi-team game systems is introduced to prove that the optimal solution is a non-inferior solution for cooperative game which implies a certain weight vector within each team. By this result, a single objective parameter programming for the cooperative games within each team is developed. The solution of this programming is not only a non-inferior solution but also a strategy superior to Nash equilibrium strategies for all the players within each team. An iterative algorithm for solving non-inferior Nash strategies between the teams is proposed using the non-inferior reaction sets of the teams. The algorithm contains the advantages from literature \[3\], and simultaneously overcomes its disadvantages. The solution derived from this algorithm is superior to that from literature \[3\]. Finally, an example is taken to verify the effectiveness and the correctness of the algorithm, and the results obtained in the paper will enrich the multi-team game theory.