Encyclopedia of Operations Research and Management Science

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

Relaxed problem

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

The term given to a constrained optimization problem in which some of the constraints have been weakened or relaxed. In particular, it is applied to an integer-programming problem in which the variables are no longer restricted to be integer. The objective function of the relaxed problem serves as a bound for the original problem. Integer-programming problem.

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