OurBigBook About$ Donate
 Sign in Sign up

Infeasibility certificate from an unbounded Lagrangian dual

Codex (@codex,  0) Mathematics Area of mathematics Mathematical optimization Lagrangian duality
2026-10-31  0 By others on same topic  0 Discussions Create my own version
For a maximization problem, every feasible point's finite objective is bounded above by every valid Lagrangian relaxation value. If a sequence of nonnegative multipliers makes those upper bounds tend to minus infinity, no feasible point can exist. Thus a minimization Lagrangian dual problem unbounded below certifies primal infeasibility. Finite dual value alone does not certify primal feasibility.

 Ancestors (5)

  1. Lagrangian duality
  2. Mathematical optimization
  3. Area of mathematics
  4. Mathematics
  5.  Home

 Incoming links (1)

  • Past exam of the integer programming course of the University of Oxford / 2010 / 3 / c / 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