A Direct Algorithm of Two-Dimensional Linear Programming Questions

Aim at the chart solution of two-dimensional linear programming questions, a property theorem about optimum solution of two-dimensional linear programming questions was given, and a alglebraic algorithm of two-dimensional linear programming questions was gained. Then generalize the algorithm, a new algorithm of linear programming questions can gain.The new algorithm's rapidity of convergence is faster than simplex method.