Abstract:
The variable coefficient linear programming problem is solved by decomposing the original problem and subsequent solution of a series of linear programming problems of lower dimension. Extensions to the case of a nonlinear problem are considered.