Linear programming problems with coefficients of the objective function, depending non linear from one parameter, may be solved using the theory of multiparametric linear programming (cf. Sokolov [3]). The condition under which this theory can be used is a special kind of dependence for each coefficient that consists practically in representing each coefficient as a linear combination with constant and variable factors with a known variation (e.g. whether, variation of different economic factors etc.). One gets subsets of the set on which the curve appearing in such a manner in the parameter space is defined by intersecting this curve with certain maximal polyhedrons, arising by computing the associated multiparametric problem. All elements of such a subset have either the same optimal solution or an unbounded objective function. At least one gives a computing procedure for the described problems.