Cover the token bill. Keep Hermex open.

Find the lowest-maintenance integer mix that covers the monthly target in both base and downside scenarios. Every value is an editable assumption, not a revenue promise.

Monthly cost target$

Four integer channels ready to solve.

Non-paywall channelBase $ / unitDownside $ / unitHours / unitMonthly cap

Objectiveminimize creator hours

Coveragebase and downside must both reach target

Integrityinteger units with explicit channel caps

Lowest-maintenance feasible mix

5.6 hours

One sponsor, 23 supporters, and six tips cover the downside target exactly without a paywall.

Scenario output only. No payment processing, sponsor discovery, outreach, grant eligibility, or guaranteed revenue is included.

Integral MILP result

Awaiting solve

Base coverage

$0 slack

Downside coverage

$0 slack

Why this mix wins

The solver minimizes total creator hours across every integer combination that satisfies both revenue constraints.

Binding constraint

Downside coverage binds at the declared monthly target.

Model: minimize sum(count × hours) subject to sum(count × base revenue) ≥ target, sum(count × downside revenue) ≥ target, and 0 ≤ count ≤ monthly cap for every channel.