Encyclopedia of Operations Research and Management Science

2001 Edition
| Editors: Saul I. Gass, Carl M. Harris

Generalized upper-bounded (GUB) problem

Reference work entry
DOI: https://doi.org/10.1007/1-4020-0611-X_380

A linear-programming problem with a set of constraints of the form Σxj = 1, where Jv is a subset of the indices j = 1, 2,..., n and each j can appear at most once in some Jv. This problem is called a GUB problem and a special adaptation of the simplex method is available that reduces the computational burden of having a large number of GUB constraints.

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  1. 1.Robert H. Smith School of BusinessUniversity of MarylandCollege PartUSA
  2. 2.School of Information Technology & EngineeringGeorge Mason UniversityFairfaxUSA