Capacities require explicit assignments

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 6 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 2.

The nearest-site reassignment was rejected: Capacity exceeded at S0: load 4, capacity 2.

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 ada84fbede9ebf46e1eacfa60f45056d62e7cd5c5d50ba6e9a6f28f669dc6526
• costs.csv · SHA-256 4120811aaf5e90a9ff2a7b6e497a51fbe6692680fba4a870ef4d0c294f70331c
• selected.csv · SHA-256 e0fbf53dac7e863b9625e750aa3e48c7561139613819bdf5c91de031a8362dcb
• sites.csv · SHA-256 76d941660529c4a05bddab90e09b6f7175b23e5e18b65f571e9c7272281bfa4f
• study.json · SHA-256 4ec921ee86dee83e0ef236f78ec9124d2ff8b5bfcc0c92a26eaa91b47801b015