PackMize Benchmark Lab
Reproducible test cases that run in your browser against the same deterministic engines used by the public calculators.
What this page proves — and what it does not
PackMize does not claim that every packing or cutting instance is globally optimal. Each engine calculates a mathematical lower or upper bound where a valid bound is available. A result is labelled PROVEN OPTIMAL only when the returned solution reaches that bound or an exact search establishes that no better solution exists. Otherwise the result remains BEST SOLUTION FOUND.
The suite combines simple audit cases with deliberately harder challenge cases. The audit cases make the proof logic easy to inspect by hand. The challenge cases are included specifically to show that PackMize does not label every plausible result as globally optimal when the mathematical bound has not been reached.
A challenge case may become PROVEN OPTIMAL in a future engine version if a stronger strategy reaches the bound or an exact method proves the optimum. That change would be evidence of solver improvement, not a reason to preserve an artificial BEST SOLUTION FOUND result.
Live benchmark suite
| Case | Engine | Result | Mathematical bound | Status |
|---|
Why publish benchmarks?
Optimization quality is more meaningful than the number of input fields or the appearance of a calculator. PackMize publishes reproducible cases so users can distinguish between a result that merely looks plausible, a result that reaches a mathematical bound, and a result for which PackMize has found a strong solution but cannot yet prove global optimality.
Future benchmark sets may include larger public academic instances. When external datasets are used, PackMize will identify the source, the exact instance and the engine version rather than publishing untraceable aggregate claims.