Optimization Assurance · Assignment review

Generated weighted facility review

Submitted plan fails the declared constraints

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

Submitted costNot accepted
Best checked costUnknown
Relaxed lower bound2
Best plan proven optimal?Unknown

Review findings

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

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

Conventional solver

Infeasible, 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