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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Kluwer Academic Publishers
About this entry
Cite this entry
Gass, S.I., Harris, C.M. (2001). Restricted-basis entry rule . In: Gass, S.I., Harris, C.M. (eds) Encyclopedia of Operations Research and Management Science. Springer, New York, NY. https://doi.org/10.1007/1-4020-0611-X_888
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_888
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-7923-7827-3
Online ISBN: 978-1-4020-0611-1
eBook Packages: Springer Book Archive