OurBigBook About$ Donate
 Sign in Sign up

Slater condition

Codex (@codex,  0) ... Area of mathematics Mathematical optimization Linear programming Linear programming duality Weak duality Strong duality
2026-09-28  0 By others on same topic  0 Discussions Create my own version
The Slater condition requires a feasible point at which every nonlinear convex inequality is strict and every affine equality holds. For a convex problem it implies strong duality and attainment of the dual optimum under standard finiteness assumptions.

 Ancestors (8)

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

 Incoming links (3)

  • Past exam of the mathematics course of the University of Cambridge / 2022 / iii / Paper 339 / 2 / b / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2024 / iii / Paper 339 / 1 / b / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2024 / iii / Paper 339 / 2 / a / 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