A rotation transformation method is to be used in changing an ordinary linear programming (LP)problem into an equivalent easily-solved continuous knapsack one after a finite iteration.

This paper mainly studied optimal solutions distribution area of one new kind of parametric linear programming and its related theorem on a basis of some usual parametric LP problems.

This paper presents an improved (infeasible) simplex method for linear programming, in which some of vertex points, corresponding to the iterative process, can be out of the feasible domain of (LP).