Optimization Assurance · Assignment review

Generated weighted facility review

Review complete

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

Submitted cost40
Best checked cost10
Relaxed lower bound0
Best plan proven optimal?Unknown

Review findings

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

The best checked cost is at most 10 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 30.

Submitted plan

Open sites: S1

Site IDAssigned demand
S111
Client assignments
Client IDSite ID
C0S1
C1S1

Best checked plan

Open sites: S0

Site IDAssigned demand
S011
Client assignments
Client IDSite ID
C0S0
C1S0

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.

Evidence and scope

Exact frozen weighted assignment model only. No strict-metric/source-theorem eligibility, geographic validation or customer benefit is established.

Limits: 512 clients, 128 sites, eight MiB per file, sixteen MiB combined and 128-bit rational input components. Optional solver: two seconds, one worker; exact scales capped at one million and integer range capped conservatively.

Review JSON · File manifest