Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03478760n
Noun Concept
Categories: Convex optimization, Relaxation (approximation)
EN
Lagrangian relaxation  dual decomposition
EN
In the field of mathematical optimization, Lagrangian relaxation is a relaxation method which approximates a difficult problem of constrained optimization by a simpler problem. Wikipedia
Definitions
Relations
Sources
EN
In the field of mathematical optimization, Lagrangian relaxation is a relaxation method which approximates a difficult problem of constrained optimization by a simpler problem. Wikipedia
The method of approximating a difficult constrained problem with an easier problem having an enlarged feasible set Wikipedia Disambiguation
NAMED AFTER
Joseph-Louis Lagrange
Wikipedia
EN
Lagrangian relaxation
Wikidata
EN
Lagrangian relaxation
Wikipedia Redirections
EN
dual decomposition

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License