The traditional appropriate non-inferior solution just compares the improvement of two goals to define the point of m.

By means of the algorithm which seeks for a final solution of non-inferior solutions closest to the ideal objective solution, a practical example is calculated to obtain a satisfactory result.

Theoretical analysis and case study show this method can guarantee the network to converge to non inferior solution of the multiobjective linear programming.