The condition l j ≤ x j, l j ≠0, defines x j as a lowerbounded variable. Such conditions are often part of the constraint set of an optimization problem. For linear-programming, these conditions can be removed explicitly by appropriate transformations, given that the problem is feasible when x j = l j for each j.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author 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). Lower-bounded variables . 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_564
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_564
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