Exact fractional demand and capacity

Objective units: demand units × cost units per demand unit · 09 October 2026, 01:54 UTC

Review findings

• Selected sites, required IDs, complete whole-client assignments and capacity loads passed exact checks.

Lower bound: Each client may use its cheapest candidate; opening count, required sites and capacities relaxed.

The best checked cost is at most 4/15 above the optimum for this model. This is a bound on suboptimality, not a measured difference from a known optimum.

Best checked plan reduces submitted cost by 0.

The nearest-site reassignment was rejected: Capacity exceeded at S0: load 1, capacity 1/3.

Submitted plan

Open sites: S0, S1

Best checked plan

Open sites: S0, S1

Conventional solver

Optimal, as reported by the solver. Solver status and numerical bounds remain separate from independent optimality.

Input provenance

Generated computational control; no customer or geographic data.

Supplied provenance is not independently verified.

• assignments.csv · SHA-256 92e08db4079de7c1eee8c2f726f0224e4eeb3b5dac502813fffefd1810a4f6cd
• clients.csv · SHA-256 17121dd19fb59b3263fb09a54458dff5d88f74cebe6c781ff5d7ead94ea6511e
• costs.csv · SHA-256 13f75627a4583c3a51495cd59efb528e5bd8814b13c88b38ea3230e486de1d41
• selected.csv · SHA-256 e0fbf53dac7e863b9625e750aa3e48c7561139613819bdf5c91de031a8362dcb
• sites.csv · SHA-256 9f6c42c3a7f5f06b74076eaa9d43b96909fcd433bcc8035a3dbedf6be2b6db18
• study.json · SHA-256 a6062c82231d749e6a723501e3102cda99ece1b9f46a32c708d494db149fdea4