Greedy Merit-Order Dispatch
HeuristicSort generators by variable cost ascending to form a merit order. Commit the cheapest unit first, dispatch it to min(pMax, remaining), subtract from demand, repeat. Objective: min Σ (cᵢpᵢ + Sᵢ) — no backtracking, O(n log n), no optimality guarantee.
Generator Fleet
Name
P-MinP-MaxVar $Start $
1
P-Min
P-Max
Var $
Start $
1
2
P-Min
P-Max
Var $
Start $
2
3
P-Min
P-Max
Var $
Start $
3
Max cap: 180 MW
Dispatch Summary
Run solver to see dispatch.
Algorithm
Sort generators by variable cost ascending. Commit cheapest units first until demand is met. O(n log n) — no optimality guarantee.
Dispatch Schedule
Run the solver to see dispatch schedule.