| Abstract: | This paper proposes a decomposition of a linear programming problem based on the structure of the optimal basis matrix. If this matrix contains a zero matrix of appropriate dimensions, the problem may be decomposed into a price-setting problem and a quantity-setting problem. This decomposition is valid for a set of coefficients of the problem to be determined by parametric programming. It can be applied to problems with common constraints or common variables. An application to dairy production planning is discussed and a comparison with the Dantzig-Wolfe decomposition principle is given. |
