A 'relaxation technique' is a method in
mathematical optimization for relaxing a strict requirement, by either substituting for it another more easily handled requirement or else dropping it completely. Relaxation techniques are widely used in
branch and bound methods.
Some relaxation techniques
★
LP relaxation
★
Lagrangian relaxation
See also
★
Relaxation method