A fixed marketing budget is split across eight channels. Each channel turns spend into customers with diminishing returns, conv = cap·(1 − e^(−eff·spend)): the first dollars are productive, later ones saturate. The optimum equalises marginal returns across channels (water-filling) under the budget. Score is negative total conversions, to minimise. 8-D problem.
| Algorithm | Conversions | Evals |
|---|---|---|
| — no runs yet — | ||
The JS objective is a line-for-line port of
example_applications/ad_budget_allocation and agrees with it to
floating-point tolerance. The bars show spend per channel; the dotted caps show each
channel's maximum achievable conversions.