- 16 Downloads
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.