Abstract: In rhis  paper, a new solution of linear programming problem is developed according to the followung three principle:

Feasible region   D={ \vec{x}| (\vec{ai},\vec{x})\leqbi  I=1, 2, ..., N+M}  is regarded as the intersection of some K-region, where K-region is the region which is formed by  n+1 pieces of super-plane in n dimensional Space.

A series of results could ne obtained by this method for the sensitivity analysis, parameteric linear programming, integer programming and other respects.