This paper explains a new method for solving linear programming problems of largedimension, based on decomposition in columms of the starting problem. An exactly solving procedure is reclived by using primal simple algorithms. Furthermore, some statements about the computional realisation are given and their application to some special structure of the restriction matrix will be inquired. For the speical case of nonnegativ coefficient-matrix will be given an estimation for the optimal solution.