Relaxation technique (mathematics)
From Wikipedia, the free encyclopedia
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.
[edit] Some relaxation techniques
 |
This mathematics-related article is a stub. You can help Wikipedia by expanding it. |
