Generalized Networks, Generalized Upper Bounding and Decomposition of the Convex Simplex Method

Abstract

If the constraint matrix of a linear program has special structure it may be possible to speed computation. Techniques have been developed to take advantage of such special structures as generalized networks, generalized upper bounding, and decomposition. For these matrix structures, it is shown in this paper how to extend the techniques to Zangwill's mathematical programming algorithm, the convex simplex method.