Metraipolis › archive › dc_a6bdae404198
Karush–Kuhn–Tucker conditions — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Karush%E2%80%93Kuhn%E2%80%93Tucker_conditions
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-06T13:16:11.399Z
- SHA-256 of the archived text
1f92b7dce72702dfa9060dc15a7cb40f5a5549e8b1281456801ec194b0929d3c- Stable URL of this page
https://metraipolis.com/documento/dc_a6bdae404198
How to cite
Karush–Kuhn–Tucker conditions — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Karush%E2%80%93Kuhn%E2%80%93Tucker_conditions (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_a6bdae404198 (Metraipolis archive dc_a6bdae404198, sha256 1f92b7dce72702dfa9060dc15a7cb40f5a5549e8b1281456801ec194b0929d3c)
BibTeX
@misc{dca6bdae404198,
title = {Karush–Kuhn–Tucker conditions — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Karush%E2%80%93Kuhn%E2%80%93Tucker_conditions},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_a6bdae404198; sha256 1f92b7dce72702dfa9060dc15a7cb40f5a5549e8b1281456801ec194b0929d3c},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Karush%E2%80%93Kuhn%E2%80%93Tucker_conditions. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In mathematical optimization, the Karush–Kuhn–Tucker (KKT) conditions, also known as the Kuhn–Tucker conditions, are first derivative tests (sometimes called first-order necessary conditions) for a solution in nonlinear programming to be optimal, provided that some regularity conditions are satisfied. Allowing inequality constraints, the KKT approach to nonlinear programming generalizes the method of Lagrange multipliers, which allows only equality constraints. Similar to the Lagrange approach, the constrained maximization (minimization) problem is rewritten as a Lagrange function whose optimal point is a global maximum or minimum over the domain of the choice variables and a global minimum (maximum) over the multipliers. The Karush–Kuhn–Tucker theorem is sometimes referred to as the saddle-point theorem. The KKT conditions were originally named after Harold W. Kuhn and Albert W. Tucker, who first published the conditions in 1951. Later scholars discovered that the necessary conditions for this problem had been stated in an unpublished master's thesis by William Karush in 1939. Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «mathematical optimization»). Fonte: Wikipedia in inglese, voce «Karush–Kuhn–Tucker conditions» — https://en.wikipedia.org/wiki/Karush%E2%80%93Kuhn%E2%80%93Tucker_conditions Wikidata Q2075125: «first-order necessary conditions for a solution in nonlinear programming to be optimal» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q2075125 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Karush%E2%80%93Kuhn%E2%80%93Tucker_conditions?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 1358466796, consultata il 2026-10-06T11:30:25.032Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 95992134063e9897580d4e2e49979a9cb770a498a50bf8f30b1ff5a51f7e04f8