FA-12009 / Optimization solver contracts / Member archive
Branch and bound prunes against an infeasible incumbent · case 04
Branch and bound prunes against an infeasible incumbent.
Case contract
Minimization, one optimum required: prune iff incumbent is feasible and node lower bound>=incumbent objective.
Why this case matters
This deterministic solver-step model isolates an algorithmic invariant used by iterative optimization implementations.
One recorded failure
Sample boundary fixtureThis sample comes from the broken implementation of a controlled reproducer.
| Boundary fixture | Actual | Expected | Outcome |
|---|---|---|---|
| infeasible estimate | true | false | Failed |
MEMBER ARCHIVE
The complete case is available to members.
This record includes three runnable implementations, regression fixtures, execution results, and source hashes.
Member access is invitation-based. Sign in with your invited account to inspect the sources.
Sign in to the archive ↗