Minimum-cost Coverage Workbench

How to use Minimum-cost Coverage Workbench

Track the exact cheapest choice for every finite requirement mask, add each candidate at most once and expose the selected rows and coverage of each requirement.

1. Use the example as the schema; replace its labels and entered model assumptions.
2. Track the exact cheapest choice for every finite requirement mask, add each candidate at most once and expose the selected rows and coverage of each requirement.
3. Calculate, inspect the complete witnesses and limitations, then copy or download the JSON report.

Good to know

• 1–12 distinct requirements and 0–30 distinct candidates; each covers at least one known distinct requirement. Nonnegative costs use decimal strings up to 1 billion with six places.
• At most 4,096 requirement states; overlapping coverage is allowed. No quotas, capacities, geography, candidate dependencies or minimum-count secondary objective. This exact small instance is not an emergency-service siting recommendation.
• Local calculation with no upload, input persistence or outside lookup. Model JSON is limited to 30,000 characters and 10,000 values. Decimal quantities are strings with up to six places; count fields use plain JSON integers. Exact fractions are capped at 8,192 bits. The complete JSON output is limited to 1,000,000 characters; approximate numbers preserve their stored values. Unsupported states fail explicitly.