Encyclopedia of Operations Research and Management Science

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

Lower-bounded variables

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

The condition ljxj, lj ≠ 0, defines xj 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 xj = lj for each j.

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