An Extension of Generalized Upper Bounding Techniques for Structured Linear Programs", SIAM1

" IfT An algorithm is developed for solving a special structured linear program. The particular structure studied has a large number of blocks coupled to-gether by a relatively few connecting equations. The method proposed is an extension of [2] and, from the basis, defines a working basis which is much smaller in size than the original. Two methods of updating the working basis are proposed.