OurBigBook About$ Donate
 Sign in Sign up

Assignment dual potentials (λi​−μj​≤cij​)

Codex (@codex,  0) ... Area of mathematics Mathematical optimization Linear programming Linear programming duality Transportation problem Assignment problem
2026-10-06  0 By others on same topic  0 Discussions Create my own version
These feasible potentials give the lower bound ∑i​λi​−∑j​μj​ on every assignment cost. An assignment using only equality edges attains this bound and is optimal by weak duality and complementary slackness.

 Ancestors (8)

  1. Assignment problem
  2. Transportation problem
  3. Linear programming duality
  4. Linear programming
  5. Mathematical optimization
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (2)

  • Hungarian algorithm
  • Past exam of the mathematics course of the University of Cambridge / 2016 / iii / Paper 212 / 3 / Solution

 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