Show simple item record

dc.contributor.authorBrown, Gerald G.
dc.contributor.authorThomen, David S.
dc.date1980
dc.date.accessioned2014-01-09T22:21:13Z
dc.date.available2014-01-09T22:21:13Z
dc.date.issued1980
dc.identifier.citationBrown, G.G. and Thomen, D., 1980, “Automatic Identification of Generalized Upper Bounds in Large-Scale Optimization,” Management Science, 26, 11, pp. 1166-1184.
dc.identifier.urihttp://hdl.handle.net/10945/38137
dc.descriptionManagement Science, 26, 11, pp. 1166-1184.en_US
dc.description.abstractTo solve contemporary large-scale linear, integer and mixed integer programming problems, it is often necessary to exploit intrinsic special structure in the model at hand. One commonly used technique is to identify and then to exploit in a basis factorization algorithm a generalized upper bound (GUB) structure. Computer programs have been written to permit comparison of computational efficiency. The GUB programs have been incorporated in an existing optimization system of advanced design and have been tested on a variety of large-scale real-life optimization problems. The identification of GUB sets of maximum size is shown to be among the class of NP-complete problems; these problems are widely conjectured to be intractable in that no polynomial-time algorithm has been demonstrated for solving them. All the methods discussed in this report are polynomial-time heuristic algorithms that attempt to find, but do not guarantee, GUB sets of maximum size. Bounds for the maximum size of GUB sets are developed in order to evaluate the effectiveness of the heuristic algorithms.en_US
dc.rightsdefined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.en_US
dc.titleAutomatic Identification of Generalized Upper Bounds in Large-Scale Optimizationen_US
dc.typeArticleen_US
dc.contributor.departmentOperations Research (OR)


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record