In this paper are considered twofold-oneparametric linear programming problems with independing parameters, that means, linear programming problems, in which the coefficients of the objective function depend on one parameter, the components of the right sides of the constraints on another. The theoretical result consists in that the parameter plane, spanned by these two parameters is decomposed into maximal rectangles with edges parallel to axes so that for all pairs of parameters belonging to the same rectangle the same solution, still containing the right-side parameter is optimal and admissible resp. no solution exists. The rectangles, belonging to optimal admissible solutions are not overlapping. Having stated the theoretical result one describes a procedure for solving practically such problems and finaly there is given a nontrivial example.