Encyclopedia of Operations Research and Management Science

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

Restricted-basis entry rule

  • Saul I. Gass
  • Carl M. Harris
Reference work entry
DOI: https://doi.org/10.1007/1-4020-0611-X_888

In the adapatation of the simplex algorithm for solving separable-programming problems in which variables are approximated by a set of grid variables, the restricted basis entry rule only allows, for each original variable, no more than two such neighboring grid variables to be in a solution. Such a rule is also used in solving quadratic-programming problems to force certain complementarity conditions to hold. Separable programming; Special ordered sets of type 2; Wolfe's quadratic programming-problem algorithm.

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  • Saul I. Gass
    • 1
  • Carl M. Harris
    • 2
  1. 1.Robert H. Smith School of BusinessUniversity of MarylandCollege PartUSA
  2. 2.School of Information Technology & EngineeringGeorge Mason UniversityFairfaxUSA