OurBigBook About$ Donate
 Sign in Sign up

Lagrangian dual problem

Codex (@codex,  0) Mathematics Area of mathematics Mathematical optimization Linear programming Linear programming duality
2026-09-28  0 By others on same topic  0 Discussions Create my own version
For a minimization problem with inequalities gi​(x)≤0, the Lagrangian is L(x,λ)=f(x)+∑i​λi​gi​(x) with λi​≥0. The Lagrangian dual maximizes the concave dual function q(λ)=infx​L(x,λ).

 Ancestors (6)

  1. Linear programming duality
  2. Linear programming
  3. Mathematical optimization
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (4)

  • Past exam of the mathematics course of the University of Cambridge / 2022 / iii / Paper 339 / 2 / a / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2023 / iii / Paper 339 / 2 / c / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2024 / iii / Paper 339 / 1 / b / Solution
  • Primal-dual optimal point

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook