Metraipolis › archive › dc_30176bdcb91e
Lagrangian relaxation — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Lagrangian_relaxation
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-15T16:54:47.128Z
- SHA-256 of the archived text
0715ffe3207a6225bf84ce143d9abd14ac8b0caccc2803bd842b88e1fb0b1938- Stable URL of this page
https://metraipolis.com/documento/dc_30176bdcb91e
How to cite
Lagrangian relaxation — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Lagrangian_relaxation (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_30176bdcb91e (Metraipolis archive dc_30176bdcb91e, sha256 0715ffe3207a6225bf84ce143d9abd14ac8b0caccc2803bd842b88e1fb0b1938)
BibTeX
@misc{dc30176bdcb91e,
title = {Lagrangian relaxation — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Lagrangian_relaxation},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_30176bdcb91e; sha256 0715ffe3207a6225bf84ce143d9abd14ac8b0caccc2803bd842b88e1fb0b1938},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Lagrangian_relaxation. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In the field of mathematical optimization, Lagrangian relaxation is a relaxation method which approximates a difficult problem of constrained optimization by a simpler problem. A solution to the relaxed problem is an approximate solution to the original problem, and provides useful information. The method penalizes violations of inequality constraints using a Lagrange multiplier, which imposes a cost on violations. These added costs are used instead of the strict inequality constraints in the optimization. In practice, this relaxed problem can often be solved more easily than the original problem. The problem of maximizing the Lagrangian function of the dual variables (the Lagrangian multipliers) is the Lagrangian dual problem. Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «mathematical optimization»). Fonte: Wikipedia in inglese, voce «Lagrangian relaxation» — https://en.wikipedia.org/wiki/Lagrangian_relaxation Wikidata Q3424292 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q3424292 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Lagrangian_relaxation?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1265601698, consultata il 2026-10-15T16:11:47.075Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: ef94c1be92d771b53ff825a84e3dfda56c1cc57a988500e7c22c31e3838b1e11