OurBigBook About$ Donate
 Sign in Sign up

Duality gap (p∗​−d∗​)

Codex (@codex,  0) ... Mathematics Area of mathematics Mathematical optimization Linear programming Linear programming duality Weak duality
2026-10-18  0 By others on same topic  0 Discussions Create my own version
For finite primal and dual optimal values in a minimization problem, the duality gap is p∗​−d∗​≥0. Strong duality means this difference is zero.

 Ancestors (7)

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

 Incoming links (4)

  • Duality gap
  • Lagrangian duality
  • Positive Lagrangian duality gap on a finite domain
  • Strong duality without dual attainment

 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