Skip to content

Rung 77: energy limits on every dispatching component — e_sum_min and e_sum_max on a generator, link, process and store, with each period weighted by its years

One rung of the PyPSA corpus: the file pypsa.yaml projected onto what this network builds, attached to that network, and held to what PyPSA solves it to.

✔ Verified against pypsa master at 3625c816 — objective 11618.75 on both sides; structure ✔ 19 constraints · 6 variables, name for name; size ✔ 143 rows · ✔ 64 columns · ✔ 255 nonzeros; duals ✔ 143 rows; model for model: 25 blocks equal, 0 documented splits, 1 recorded deviations.

Rows and columns, PyPSA against specsolve, name for name
row PyPSA specsolve
Bus-nodal_balance 16 16
Generator-e_sum_max 1 1
Generator-fix-p-lower 24 24
Generator-fix-p-upper 24 24
Link-e_sum_max 1 1
Link-e_sum_min 1 1
Link-fix-p-lower 8 8
Link-fix-p-upper 8 8
Process-e_sum_max 1 1
Process-e_sum_min 1 1
Process-fix-p-lower 8 8
Process-fix-p-upper 8 8
Store-e_sum_max 1 1
Store-e_sum_min 1 1
Store-energy_balance 8 8
Store-fix-e-lower 8 8
Store-fix-e-upper 8 8
Store-fix-p_store-lower 8 8
Store-fix-p_store-upper 8 8
column PyPSA specsolve
Generator-p 24 24
Link-p 8 8
Process-p 8 8
Store-e 8 8
Store-p 8 8
Store-p_store 8 8

The model

The same model, as math

The file states a plain n.optimize(), its multi-period class under the multi_investment_periods keyword, and its stochastic class, which n.set_scenarios(...) sets. Every quantity chosen once the future is known (second-stage) spans the futures dispatch is chosen in (scenario). Capacity is chosen once, before the future is known, and paid at its expected cost in each investment period its build year and lifetime span. Operation is the expectation over the scenarios' weights, with a share priced at the worst-outcome mean cost (CVaR) only where a risk preference is set. A plain run's data has one scenario, one period, unit weights, no outage and every active flag true, so the problem is the standard one. On a security-constrained run, PyPSA copies each branch flow limit once per outage, and the outage factors, active flags and scenario weights come from data prep.

Sets

Symbol Meaning
\(\mathcal{B}\) index \(b\) — breakpoint — the corners of a piecewise-linear curve, in order. A curve runs over the breakpoints its data has rows for, so curves may differ in length
\(\mathcal{N}\) index \(n\) — bus with \(\mathrm{Generator\_bus}: \mathcal{G} \to \mathcal{N},\ \mathrm{Link\_bus0}: \mathcal{L} \to \mathcal{N},\ \mathrm{Link\_output\_bus}: \mathcal{O} \to \mathcal{N},\ \mathrm{Load\_bus}: \mathcal{D} \to \mathcal{N},\ \mathrm{Process\_output\_bus}: \mathcal{R} \to \mathcal{N},\ \mathrm{Store\_bus}: \mathcal{V} \to \mathcal{N}\) — network nodes
\(\mathcal{G}\) index \(g\) — generator with \(\mathrm{Generator\_bus}: \mathcal{G} \to \mathcal{N}\) — generating units, each on one bus
\(\mathcal{L}\) index \(l\) — link with \(\mathrm{Link\_bus0}: \mathcal{L} \to \mathcal{N},\ \mathrm{Link\_output\_link}: \mathcal{O} \to \mathcal{L}\) — controllable connections, each from one bus to the buses it delivers to
\(\mathcal{O}\) index \(o\) — link_output with \(\mathrm{Link\_output\_bus}: \mathcal{O} \to \mathcal{N},\ \mathrm{Link\_output\_link}: \mathcal{O} \to \mathcal{L}\) — a link's output ports, one label per port a link declares. The labels are PyPSA's bus1, bus2, … columns read long, data prep. A link of any number of output ports is then one term in the balance
\(\mathcal{D}\) index \(d\) — load with \(\mathrm{Load\_bus}: \mathcal{D} \to \mathcal{N}\) — demands, each on one bus
\(\mathcal{Y}\) index \(y\) — period with \(\mathrm{snapshot\_period}: \mathcal{T} \to \mathcal{Y}\) — investment periods. It is PyPSA's investment_periods
\(\mathcal{J}\) index \(j\) — process with \(\mathrm{Process\_output\_process}: \mathcal{R} \to \mathcal{J}\) — generalised multi-port converters, each with an internal power that every port draws or delivers at its own rate
\(\mathcal{R}\) index \(r\) — process_output with \(\mathrm{Process\_output\_bus}: \mathcal{R} \to \mathcal{N},\ \mathrm{Process\_output\_process}: \mathcal{R} \to \mathcal{J}\) — a process's ports, one label per port a process declares. The labels are PyPSA's bus0, bus1, …, each with a signed rate, data prep. A process of any number of ports is then one term in the balance
\(\Xi\) index \(\xi\) — scenario — the futures dispatch is chosen in, each with a weight
\(\mathcal{T}\) index \(t\) — snapshot with \(\mathrm{snapshot\_period}: \mathcal{T} \to \mathcal{Y}\) — dispatch periods
\(\mathcal{V}\) index \(v\) — store with \(\mathrm{Store\_bus}: \mathcal{V} \to \mathcal{N}\) — pure energy stores, each on one bus

Parameters

Symbol Meaning
\(\mathrm{Bus\_attached}\) Bus_attached over \(\mathcal{N} \times \mathcal{T}\) — whether a load, a unit, a port or a branch that is active in the snapshot's period is attached to the bus, data prep. A bus nothing is attached to has no balance row
\(\mathrm{on}\) Generator_active over \(\mathcal{G} \times \mathcal{T}\) — whether a generator is active in a snapshot's period. It is PyPSA's active, from build year and lifetime, data prep
\(\mathrm{act}\) Generator_active_asset over \(\mathcal{G}\) — whether a generator is one of PyPSA's active_assets, by its active flag alone, without build year and lifetime. A unit that is active in no snapshot of the horizon still counts. PyPSA refuses one that differs by scenario (constants.py:54)
\(\mathrm{com}\) Generator_committable over \(\mathcal{G}\) — whether output is gated by an on/off status decision
\(\overline{\mathrm{E}}\) Generator_e_sum_max over \(\mathcal{G} \times \Xi\) — most energy over the horizon: a fuel or emission budget in energy terms. It is infinity where no cap is meant
\(\mathrm{c}\) Generator_marginal_cost over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — cost of one unit of output
\(\mathrm{p}^{\mathrm{curve}}\) Generator_marginal_cost_curve_p over \(\mathcal{B} \times \mathcal{G}\), absent where the data has no row — the output at each breakpoint of a generator's piecewise marginal_cost curve: PyPSA's p_pu breakpoints times p_nom, data prep. A generator with no curve has no rows
\(\mathrm{c}^{(2)}\) Generator_marginal_cost_quadratic over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — cost of the square of one unit of output
\(\overline{\mathrm{p}}\) Generator_p_max_pu over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — most output, per unit of nominal power: an availability profile
\(\underline{\mathrm{p}}\) Generator_p_min_pu over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — least output, per unit of nominal power
\(\mathrm{p}^{\mathrm{nom}}\) Generator_p_nom over \(\mathcal{G} \times \Xi\) — nominal power
\(\mathrm{ext}\) Generator_p_nom_extendable over \(\mathcal{G}\) — whether the nominal power is a decision
\(\mathrm{sgn}\) Generator_sign over \(\mathcal{G}\) — the sign output enters its bus's balance with. It is PyPSA's sign, 1 unless given, -1 for a unit that draws power. PyPSA refuses one that differs by scenario (constants.py:46)
\(\mathrm{on}^{f}\) Link_active over \(\mathcal{L} \times \mathcal{T}\) — whether a link is active in a snapshot's period. It is PyPSA's active, data prep
\(\mathrm{com}^{f}\) Link_committable over \(\mathcal{L}\) — whether flow is gated by an on/off status decision
\(\overline{\mathrm{E}}^{f}\) Link_e_sum_max over \(\mathcal{L} \times \Xi\) — most energy of its flow at bus0, the withdrawal there, over the horizon. It is infinity where no cap is meant
\(\underline{\mathrm{E}}^{f}\) Link_e_sum_min over \(\mathcal{L} \times \Xi\) — least energy of its flow at bus0, the withdrawal there, over the horizon. It is minus infinity where no floor is meant
\(\eta\) Link_efficiency over \(\mathcal{O} \times \Xi \times \mathcal{T}\) — share of the flow that arrives at an output port, PyPSA's efficiency, efficiency2, … read long: negative where that port consumes rather than delivers. Read at the snapshot the flow arrives, so a delayed port delivers at its arrival snapshot's efficiency (constraints.py:1575)
\(\mathrm{c}^{f}\) Link_marginal_cost over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — cost of one unit of flow
\(\mathrm{c}^{f,(2)}\) Link_marginal_cost_quadratic over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — cost of the square of one unit of flow
\(\mathrm{cyc}^{f}\) Link_output_cyclic_delay over \(\mathcal{O}\) — whether a delayed port's flow wraps from the end of its investment period (PyPSA's cyclic_delay, cyclic_delay2, …). Where it does not, the flow still in transit at each period's first snapshots is lost. The flag is the same in every scenario, as the delay is
\(\mathrm{d}^{f}\) Link_output_delay over \(\mathcal{O}\) — snapshots a port's delivery lags its link's flow (PyPSA's delay, delay2, … read long). In data prep you divide it by the snapshot_weightings.generators value and round it up. It is zero for a port that delivers at once. A port has the same delay in every scenario, because PyPSA refuses a delay that differs by scenario (constants.py:55)
\(\overline{\mathrm{f}}\) Link_p_max_pu over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — most flow, per unit of nominal power
\(\underline{\mathrm{f}}\) Link_p_min_pu over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — least flow, per unit of nominal power: negative for a link that carries both ways
\(\mathrm{f}^{\mathrm{nom}}\) Link_p_nom over \(\mathcal{L} \times \Xi\) — nominal power
\(\mathrm{ext}^{f}\) Link_p_nom_extendable over \(\mathcal{L}\) — whether the nominal power is a decision
\(\mathrm{on}^{\mathrm{load}}\) Load_active over \(\mathcal{D}\) — whether a load is active in the network, PyPSA's active. A load has no build year and no lifetime, so the flag is the same in every snapshot. PyPSA refuses one that differs by scenario (constants.py:54)
\(\mathrm{load}\) Load_p_set over \(\mathcal{D} \times \Xi \times \mathcal{T}\) — demand
\(\mathrm{sgn}^{\mathrm{load}}\) Load_sign over \(\mathcal{D}\) — the sign a load's demand enters its bus's balance with. It is PyPSA's sign, -1 unless given, 1 for a load that feeds its bus. PyPSA refuses one that differs by scenario (constants.py:46)
\(\mathrm{on}^{z}\) Process_active over \(\mathcal{J} \times \mathcal{T}\) — whether a process is active in a snapshot's period. It is PyPSA's active, data prep
\(\mathrm{com}^{z}\) Process_committable over \(\mathcal{J}\) — whether internal power is gated by an on/off status decision
\(\overline{\mathrm{E}}^{z}\) Process_e_sum_max over \(\mathcal{J} \times \Xi\) — most energy of its internal power over the horizon. It is infinity where no cap is meant
\(\underline{\mathrm{E}}^{z}\) Process_e_sum_min over \(\mathcal{J} \times \Xi\) — least energy of its internal power over the horizon. It is minus infinity where no floor is meant
\(\mathrm{c}^{z}\) Process_marginal_cost over \(\mathcal{J} \times \Xi \times \mathcal{T}\) — cost of one unit of internal power
\(\mathrm{c}^{z,(2)}\) Process_marginal_cost_quadratic over \(\mathcal{J} \times \Xi \times \mathcal{T}\) — cost of the square of one unit of internal power
\(\mathrm{cyc}^{z}\) Process_output_cyclic_delay over \(\mathcal{R}\) — whether a delayed port's transfer wraps from the end of its investment period (PyPSA's cyclic_delay0, cyclic_delay1, …). Where it does not, the energy still in transit at each period's first snapshots is lost. The flag is the same in every scenario, as the delay is
\(\mathrm{d}^{z}\) Process_output_delay over \(\mathcal{R}\) — snapshots a port's transfer lags its process's internal power (PyPSA's delay0, delay1, … read long). In data prep you divide it by the snapshot_weightings.generators value and round it up. It is zero for a port that transfers at once. A port has the same delay in every scenario, as a link's port has
\(\overline{\mathrm{z}}\) Process_p_max_pu over \(\mathcal{J} \times \Xi \times \mathcal{T}\) — most internal power, per unit of nominal power
\(\underline{\mathrm{z}}\) Process_p_min_pu over \(\mathcal{J} \times \Xi \times \mathcal{T}\) — least internal power, per unit of nominal power: negative for a process that runs both ways
\(\mathrm{z}^{\mathrm{nom}}\) Process_p_nom over \(\mathcal{J} \times \Xi\) — nominal internal power
\(\mathrm{ext}^{z}\) Process_p_nom_extendable over \(\mathcal{J}\) — whether the nominal internal power is a decision
\(\alpha\) Process_rate over \(\mathcal{R} \times \Xi \times \mathcal{T}\) — the energy a port draws or delivers per unit of internal power (PyPSA's rate0, rate1, … read long). It is negative where the port withdraws and positive where it injects. A link is a process whose bus0 rate is minus one and whose output rates are its efficiencies. The rate at the snapshot the transfer arrives applies, so a delayed port transfers at its arrival snapshot's rate (constraints.py:1575)
\(\mathrm{on}^{e}\) Store_active over \(\mathcal{T} \times \mathcal{V}\) — whether a store is active in a snapshot's period. It is PyPSA's active, data prep
\(\mathrm{cyc}^{e}\) Store_e_cyclic over \(\Xi \times \mathcal{V}\) — whether the horizon closes on itself instead of opening on the initial energy
\(\mathrm{cyc}^{e,y}\) Store_e_cyclic_per_period over \(\Xi \times \mathcal{V}\) — whether each investment period closes on itself instead of carrying its energy on to the next. It overrides e_cyclic and e_initial_per_period. PyPSA reads it only under multi_investment_periods. Otherwise you feed false in data prep
\(\mathrm{e}^{0}\) Store_e_initial over \(\Xi \times \mathcal{V}\) — energy held before the first snapshot
\(\mathrm{reset}^{e}\) Store_e_initial_per_period over \(\Xi \times \mathcal{V}\) — whether each investment period opens on the initial energy instead of carrying the previous period's. PyPSA reads it only under multi_investment_periods. Otherwise you feed false in data prep
\(\overline{\mathrm{e}}\) Store_e_max_pu over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — most energy held, per unit of nominal capacity
\(\underline{\mathrm{e}}\) Store_e_min_pu over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — least energy held, per unit of nominal capacity: negative for a store that may go short
\(\mathrm{e}^{\mathrm{nom}}\) Store_e_nom over \(\Xi \times \mathcal{V}\) — nominal energy capacity
\(\mathrm{ext}^{e}\) Store_e_nom_extendable over \(\mathcal{V}\) — whether the nominal energy capacity is a decision
\(\overline{\mathrm{E}}^{q}\) Store_e_sum_max over \(\Xi \times \mathcal{V}\) — most energy of its net dispatch over the horizon. It is infinity where no cap is meant
\(\underline{\mathrm{E}}^{q}\) Store_e_sum_min over \(\Xi \times \mathcal{V}\) — least energy of its net dispatch over the horizon. It is minus infinity where no floor is meant
\(\eta^{e,+}\) Store_efficiency_dispatch over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — share of the energy drawn down that reaches the bus
\(\eta^{e,-}\) Store_efficiency_store over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — share of the power drawn from the bus that becomes energy held
\(\mathrm{idle}^{e}\) Store_inactive_snapshots over \(\mathcal{V}\) — how many snapshots a store is not active in. It is PyPSA's (~active).sum(), data prep. A cyclic store reaches back this many snapshots further, so it closes on the last snapshot it is active in
\(\mathrm{inflow}^{e}\) Store_inflow over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — energy arriving per hour, a river into a reservoir
\(\mathrm{c}^{q}\) Store_marginal_cost over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — cost of one unit of power delivered
\(\mathrm{c}^{q,+}\) Store_marginal_cost_dispatch over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — cost of one unit of discharge, p + p_store
\(\mathrm{c}^{q,(2)}\) Store_marginal_cost_quadratic over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — cost of the square of the net power delivered, so charging costs as much as delivering
\(\mathrm{c}^{e}\) Store_marginal_cost_storage over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — cost of one unit of energy held over one snapshot
\(\mathrm{c}^{q,-}\) Store_marginal_cost_store over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — cost of one unit of charging, p_store
\(\mathrm{T}^{e}\) Store_max_hours over \(\Xi \times \mathcal{V}\), absent where the data has no row — energy capacity, as hours of discharge at the power rating. The rating is e_nom / max_hours. No value means PyPSA's default of infinity, and the store's power is then unbounded
\(\mathrm{open}^{e}\) Store_opens_late over \(\mathcal{T} \times \mathcal{V}\) — whether a snapshot is the first a store is active in, where that is not the first of the horizon, data prep. It is PyPSA's active.cumsum() == 1 over the snapshots it is active in, past the first snapshot. It is false in a run where every store is active throughout
\(\underline{\mathrm{q}}\) Store_p_min_pu over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — most charging, per unit of the power rating, negated. It is PyPSA's p_min_pu, -1 unless given, read only where max_hours has a value
\(\rho^{e}\) Store_retention over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — share of energy kept over a snapshot. It is PyPSA's (1 - standing_loss) ** elapsed hours, data prep
\(\mathrm{sgn}^{q}\) Store_sign over \(\mathcal{V}\) — the sign the power a store delivers enters its bus's balance with. It is PyPSA's sign, 1 unless given. PyPSA refuses one that differs by scenario (constants.py:46)
\(\mathrm{split}^{e}\) Store_split_dispatch over \(\Xi \times \mathcal{V}\) — whether a store charges through p_store apart from its net dispatch p. It is PyPSA's split_dispatch(): true where an efficiency differs from one, a cost applies to one direction only, or cycles_max is finite, in any snapshot (stores.py:88-116), data prep. Where it is false, p_store is held at zero and the charging bound applies to p
\(\mathrm{w}^{y}\) period_weight_objective over \(\mathcal{Y}\) — PyPSA's investment_period_weightings.objective — what a period's cost weighs. PyPSA reads it only under multi_investment_periods. Otherwise you feed one in data prep, whatever the column contains (optimize.py:231-233, :293-297)
\(\mathrm{w}^{\mathrm{yr}}\) period_weight_years over \(\mathcal{Y}\) — PyPSA's investment_period_weightings.years — what a period's energy weighs in a primary_energy, operational_limit or e_sum row. PyPSA reads it only under multi_investment_periods. Otherwise you feed one in data prep
\(\pi\) scenario_weight over \(\Xi\) — PyPSA's scenario_weightings.weight — the probability of a future
\(\mathrm{w}^{\mathrm{gen}}\) snapshot_weightings_generators over \(\mathcal{T}\) — PyPSA's snapshot_weightings.generators — hours a snapshot weighs in an energy total
\(\mathrm{w}\) snapshot_weightings_objective over \(\mathcal{T}\) — PyPSA's snapshot_weightings.objective — hours a snapshot weighs in the cost
\(\mathrm{w}^{\mathrm{sto}}\) snapshot_weightings_stores over \(\mathcal{T}\) — PyPSA's snapshot_weightings.stores — hours a snapshot weighs in a storage balance

Conditions

Symbol Meaning
\(\mathrm{Generator\_marginal\_cost\_curve}\) Generator_marginal_cost_curve over \(\mathcal{G}\) — a generator that pays along a piecewise marginal_cost curve: one of PyPSA's active_assets with curve data (optimize.py:307, piecewise.py:230-257)

Variables

Symbol Meaning
\(C^{\mathrm{curve}}\) Generator_marginal_cost_piecewise over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — Generator-marginal_cost_piecewise — the running cost of a generator that pays along a curve, held above the curve
\(p\) Generator_p over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — Generator-p — output of a generator in a snapshot
\(f\) Link_p over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — Link-p — PyPSA's p0, the flow measured at the Link_bus0 end. A positive value withdraws there and injects at every bus the link's output ports deliver to
\(z\) Process_p over \(\mathcal{J} \times \Xi \times \mathcal{T}\) — Process-p — PyPSA's internal power p. A positive value drives every port at its own rate, withdrawing where the rate is negative and injecting where it is positive
\(e\) Store_e over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — Store-e — energy held at the end of a snapshot
\(q\) Store_p over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — Store-p — net power delivered to the bus. Charging is negative
\(q^{-}\) Store_p_store over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — Store-p_store — power drawn from the bus to charge, so that p + p_store is the discharge. It is held at zero by its rows where the store does not split its dispatch

Definitions

Symbol Meaning
\(\mathit{Bus\_injection}\) Bus_injection over \(\mathcal{N} \times \Xi \times \mathcal{T}\) — what every component puts into a bus, less what it takes out of it. PyPSA writes each term into the balance, and a load on its right-hand side
\(\mathit{Generator\_injection}\) Generator_injection over \(\mathcal{N} \times \Xi \times \mathcal{T}\)
\(\mathit{Generator\_opex}\) Generator_opex over \(\Xi\)
\(\mathit{Generator\_running\_cost}\) Generator_running_cost over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — what a generator's output costs in a snapshot: the value read off its piecewise curve where it has one, and its linear marginal_cost otherwise. A curve replaces the linear cost, as PyPSA drops the unit from that term (optimize.py:333-348)
\(\mathit{Link\_injection}\) Link_injection over \(\mathcal{N} \times \Xi \times \mathcal{T}\)
\(\mathit{Link\_opex}\) Link_opex over \(\Xi\)
\(\mathit{Link\_output\_arrival}\) Link_output_arrival over \(\mathcal{O} \times \Xi \times \mathcal{T}\) — what a link delivers to an output port at a snapshot. It is its flow delayed by the port's delay within its investment period. It is multiplied by the port's efficiency at the snapshot the flow arrives. Where the port is cyclic_delay, the delayed flow wraps from the period's end. Where it is not, the flow still in transit at the period's first snapshots is lost. A port that does not delay (delay zero) delivers its flow unshifted, cyclic or not
\(\mathrm{Load\_demand}\) Load_demand over \(\mathcal{D} \times \Xi \times \mathcal{T}\) — what a load draws from its bus's balance. It is its demand times its sign where it is active, and nothing where it is not. PyPSA drops an inactive load from the balance (constraints.py:1591-1592)
\(\mathrm{Load\_injection}\) Load_injection over \(\mathcal{N} \times \Xi \times \mathcal{T}\)
\(\mathit{Process\_injection}\) Process_injection over \(\mathcal{N} \times \Xi \times \mathcal{T}\)
\(\mathit{Process\_opex}\) Process_opex over \(\Xi\)
\(\mathit{Process\_output\_arrival}\) Process_output_arrival over \(\mathcal{R} \times \Xi \times \mathcal{T}\) — what a process transfers at a port at a snapshot. It is its internal power delayed by the port's delay within its investment period. It is multiplied by the port's rate at the snapshot the transfer arrives. Where the port is cyclic_delay, the delayed transfer wraps from the period's end. Where it is not, the energy still in transit at the period's first snapshots is lost. A port that does not delay (delay zero) transfers at once, cyclic or not
\(\mathrm{Store\_charge\_cap\_pu}\) Store_charge_cap_pu over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — the most charging through p_store, per unit of e_nom. It is -p_min_pu / max_hours for a store that splits its dispatch, and zero otherwise (stores.py:79-86)
\(\mathit{Store\_energy\_carried\_in}\) Store_energy_carried_in over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — the energy a store opens a snapshot with. At the first snapshot it is active in, it is its last such snapshot's less standing loss where it is cyclic. Where it is not, it is the given initial energy, which no standing loss has touched yet. Otherwise it is the previous snapshot's less standing loss. A store built in a later period opens in that period, and a cyclic one that retires closes on its own last snapshot. Per period, the same holds with each investment period as the horizon
\(\mathit{Store\_injection}\) Store_injection over \(\mathcal{N} \times \Xi \times \mathcal{T}\)
\(\mathit{Store\_opex}\) Store_opex over \(\Xi\)
\(\mathrm{energy\_limit\_weight}\) energy_limit_weight over \(\mathcal{T}\) — what one unit of power at a snapshot counts for in an e_sum row: the generator weighting times the years of the snapshot's period, as in an operational_limit row (constraints.py:2935-2937)
\(\mathit{risk\_weighted\_opex}\) risk_weighted_opex (scalar)
\(\mathit{scenario\_opex}\) scenario_opex over \(\Xi\) — what a future costs to run: every operating term, weighted by the snapshot's hours and its period, before the scenario's own weight. A start and a stop cost what they cost, unweighted, as PyPSA adds them (optimize.py:448-468)
\(\mathit{total\_cost}\) total_cost (scalar) — what the system costs. Capacity counts once per active period at its expected cost over the scenarios. Operation counts in expectation over the scenarios, and a share of it at the tail

Notation

Symbol Meaning
\(t \ominus k\) edge='wrap' — \(t-k\), cyclic
\(t \boxminus_{v} k\) edge=v — \(t-k\), and \(v\) past the edge
\(t \ominus^{\mathrm{relation}(t)} k\) within=relation[...] — \(t-k\) inside the group of \(t\)
\(\mathrm{pos}(t)\) position() — the position of \(t\), counted from \(0\); \(t\) is the label
\(\mathrm{pos}_{\mathrm{relation}(t)}(t)\) position(within=relation[...]) — the position of \(t\) inside its group

Conditions

Generator_marginal_cost_curve

\[ \mathrm{Generator\_marginal\_cost\_curve}_{g} \iff \lvert \{ b \in \mathcal{B} \,:\, \mathrm{p}^{\mathrm{curve}}_{b,g} \text{ is defined} \} \rvert > 0 \wedge \mathrm{act}_{g} \qquad \forall\, g \in \mathcal{G} \]

Variable domains

Generator_marginal_cost_piecewise

\[ C^{\mathrm{curve}}_{g,\xi,t} \in \mathbb{R} \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Generator\_marginal\_cost\_curve}_{g} \wedge \mathrm{on}_{g,t} \]

Generator_p

\[ p_{g,\xi,t} \in \mathbb{R} \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{on}_{g,t} \]

Link_p

\[ f_{l,\xi,t} \in \mathbb{R} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{on}^{f}_{l,t} \]

Process_p

\[ z_{j,\xi,t} \in \mathbb{R} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{on}^{z}_{j,t} \]

Store_e

\[ e_{\xi,t,v} \in \mathbb{R} \qquad \forall\, \xi \in \Xi,\ t \in \mathcal{T},\ v \in \mathcal{V} \,:\, \mathrm{on}^{e}_{t,v} \]

Store_p

\[ q_{\xi,t,v} \in \mathbb{R} \qquad \forall\, \xi \in \Xi,\ t \in \mathcal{T},\ v \in \mathcal{V} \,:\, \mathrm{on}^{e}_{t,v} \]

Store_p_store

\[ q^{-}_{\xi,t,v} \in \mathbb{R} \qquad \forall\, \xi \in \Xi,\ t \in \mathcal{T},\ v \in \mathcal{V} \,:\, \mathrm{on}^{e}_{t,v} \]

Definitions

Bus_injection

\[ \mathit{Bus\_injection}_{n,\xi,t} = \mathit{Generator\_injection}_{n,\xi,t} + \mathit{Link\_injection}_{n,\xi,t} + \mathrm{Load\_injection}_{n,\xi,t} + \mathit{Process\_injection}_{n,\xi,t} + \mathit{Store\_injection}_{n,\xi,t} \qquad \forall\, n \in \mathcal{N},\ \xi \in \Xi,\ t \in \mathcal{T} \]

Generator_injection

\[ \mathit{Generator\_injection}_{n,\xi,t} = \sum_{g \in \mathcal{G} \,:\, \mathrm{Generator\_bus}(g) = n} \mathrm{sgn}_{g} \cdot p_{g,\xi,t} \qquad \forall\, n \in \mathcal{N},\ \xi \in \Xi,\ t \in \mathcal{T} \]

Generator_opex

\[ \mathit{Generator\_opex}_{\xi} = \sum_{t \in \mathcal{T}} \sum_{g \in \mathcal{G}} \mathit{Generator\_running\_cost}_{g,\xi,t} \cdot \mathrm{w}_{t} \cdot \mathrm{w}^{y}_{\mathrm{snapshot\_period}(t)} + \sum_{t \in \mathcal{T}} \sum_{g \in \mathcal{G}} p_{g,\xi,t} \cdot p_{g,\xi,t} \cdot \mathrm{c}^{(2)}_{g,\xi,t} \cdot \mathrm{w}_{t} \cdot \mathrm{w}^{y}_{\mathrm{snapshot\_period}(t)} \qquad \forall\, \xi \in \Xi \]

Generator_running_cost

\[ \mathit{Generator\_running\_cost}_{g,\xi,t} = \begin{cases} C^{\mathrm{curve}}_{g,\xi,t} & \text{if } \mathrm{Generator\_marginal\_cost\_curve}_{g} \\ p_{g,\xi,t} \cdot \mathrm{c}_{g,\xi,t} & \text{otherwise} \end{cases} \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi,\ t \in \mathcal{T} \]

Link_injection

\[ \mathit{Link\_injection}_{n,\xi,t} = -\left( \sum_{l \in \mathcal{L} \,:\, \mathrm{Link\_bus0}(l) = n} f_{l,\xi,t} \right) + \sum_{o \in \mathcal{O} \,:\, \mathrm{Link\_output\_bus}(o) = n} \mathit{Link\_output\_arrival}_{o,\xi,t} \qquad \forall\, n \in \mathcal{N},\ \xi \in \Xi,\ t \in \mathcal{T} \]

Link_opex

\[ \mathit{Link\_opex}_{\xi} = \sum_{t \in \mathcal{T}} \sum_{l \in \mathcal{L}} f_{l,\xi,t} \cdot \mathrm{c}^{f}_{l,\xi,t} \cdot \mathrm{w}_{t} \cdot \mathrm{w}^{y}_{\mathrm{snapshot\_period}(t)} + \sum_{t \in \mathcal{T}} \sum_{l \in \mathcal{L}} f_{l,\xi,t} \cdot f_{l,\xi,t} \cdot \mathrm{c}^{f,(2)}_{l,\xi,t} \cdot \mathrm{w}_{t} \cdot \mathrm{w}^{y}_{\mathrm{snapshot\_period}(t)} \qquad \forall\, \xi \in \Xi \]

Link_output_arrival

\[ \mathit{Link\_output\_arrival}_{o,\xi,t} = \begin{cases} f_{\mathrm{Link\_output\_link}(o),\xi,t \ominus^{\mathrm{snapshot\_period}(t)} \mathrm{d}^{f}} \cdot \eta_{o,\xi,t} & \text{if } \mathrm{cyc}^{f}_{o} \\ f_{\mathrm{Link\_output\_link}(o),\xi,t \boxminus_{0}^{\mathrm{snapshot\_period}(t)} \mathrm{d}^{f}} \cdot \eta_{o,\xi,t} & \text{otherwise} \end{cases} \qquad \forall\, o \in \mathcal{O},\ \xi \in \Xi,\ t \in \mathcal{T} \]

Load_demand

\[ \mathrm{Load\_demand}_{d,\xi,t} = \begin{cases} \mathrm{sgn}^{\mathrm{load}}_{d} \cdot \mathrm{load}_{d,\xi,t} & \text{if } \mathrm{on}^{\mathrm{load}}_{d} \\ 0 & \text{otherwise} \end{cases} \qquad \forall\, d \in \mathcal{D},\ \xi \in \Xi,\ t \in \mathcal{T} \]

Load_injection

\[ \mathrm{Load\_injection}_{n,\xi,t} = \sum_{d \in \mathcal{D} \,:\, \mathrm{Load\_bus}(d) = n} \mathrm{Load\_demand}_{d,\xi,t} \qquad \forall\, n \in \mathcal{N},\ \xi \in \Xi,\ t \in \mathcal{T} \]

Process_injection

\[ \mathit{Process\_injection}_{n,\xi,t} = \sum_{r \in \mathcal{R} \,:\, \mathrm{Process\_output\_bus}(r) = n} \mathit{Process\_output\_arrival}_{r,\xi,t} \qquad \forall\, n \in \mathcal{N},\ \xi \in \Xi,\ t \in \mathcal{T} \]

Process_opex

\[ \mathit{Process\_opex}_{\xi} = \sum_{t \in \mathcal{T}} \sum_{j \in \mathcal{J}} z_{j,\xi,t} \cdot \mathrm{c}^{z}_{j,\xi,t} \cdot \mathrm{w}_{t} \cdot \mathrm{w}^{y}_{\mathrm{snapshot\_period}(t)} + \sum_{t \in \mathcal{T}} \sum_{j \in \mathcal{J}} z_{j,\xi,t} \cdot z_{j,\xi,t} \cdot \mathrm{c}^{z,(2)}_{j,\xi,t} \cdot \mathrm{w}_{t} \cdot \mathrm{w}^{y}_{\mathrm{snapshot\_period}(t)} \qquad \forall\, \xi \in \Xi \]

Process_output_arrival

\[ \mathit{Process\_output\_arrival}_{r,\xi,t} = \begin{cases} z_{\mathrm{Process\_output\_process}(r),\xi,t \ominus^{\mathrm{snapshot\_period}(t)} \mathrm{d}^{z}} \cdot \alpha_{r,\xi,t} & \text{if } \mathrm{cyc}^{z}_{r} \\ z_{\mathrm{Process\_output\_process}(r),\xi,t \boxminus_{0}^{\mathrm{snapshot\_period}(t)} \mathrm{d}^{z}} \cdot \alpha_{r,\xi,t} & \text{otherwise} \end{cases} \qquad \forall\, r \in \mathcal{R},\ \xi \in \Xi,\ t \in \mathcal{T} \]

Store_charge_cap_pu

\[ \mathrm{Store\_charge\_cap\_pu}_{\xi,t,v} = \begin{cases} \frac{-\underline{\mathrm{q}}_{\xi,t,v}}{\mathrm{T}^{e}_{\xi,v}} & \text{if } \mathrm{split}^{e}_{\xi,v} \\ 0 & \text{otherwise} \end{cases} \qquad \forall\, \xi \in \Xi,\ t \in \mathcal{T},\ v \in \mathcal{V} \]

Store_energy_carried_in

\[ \mathit{Store\_energy\_carried\_in}_{\xi,t,v} = \begin{cases} \rho^{e}_{\xi,t,v} \cdot e_{\xi,\left( t \ominus \mathrm{idle}^{e} \right) \ominus 1,v} & \text{if } \mathrm{cyc}^{e}_{\xi,v} \wedge \neg \mathrm{cyc}^{e,y}_{\xi,v} \wedge \neg \mathrm{reset}^{e}_{\xi,v} \wedge \left( \mathrm{pos}(t) = 0 \vee \mathrm{open}^{e}_{t,v} \right) \\ \mathrm{e}^{0}_{\xi,v} & \text{if } \neg \mathrm{cyc}^{e}_{\xi,v} \wedge \neg \mathrm{cyc}^{e,y}_{\xi,v} \wedge \neg \mathrm{reset}^{e}_{\xi,v} \wedge \left( \mathrm{pos}(t) = 0 \vee \mathrm{open}^{e}_{t,v} \right) \\ \rho^{e}_{\xi,t,v} \cdot e_{\xi,t \ominus^{\mathrm{snapshot\_period}(t)} 1,v} & \text{if } \mathrm{cyc}^{e,y}_{\xi,v} \\ \mathrm{e}^{0}_{\xi,v} & \text{if } \mathrm{reset}^{e}_{\xi,v} \wedge \neg \mathrm{cyc}^{e,y}_{\xi,v} \wedge \mathrm{pos}_{\mathrm{snapshot\_period}(t)}(t) = 0 \\ \rho^{e}_{\xi,t,v} \cdot e_{\xi,t - 1,v} & \text{otherwise} \end{cases} \qquad \forall\, \xi \in \Xi,\ t \in \mathcal{T},\ v \in \mathcal{V} \]

Store_injection

\[ \mathit{Store\_injection}_{n,\xi,t} = \sum_{v \in \mathcal{V} \,:\, \mathrm{Store\_bus}(v) = n} \mathrm{sgn}^{q}_{v} \cdot q_{\xi,t,v} \qquad \forall\, n \in \mathcal{N},\ \xi \in \Xi,\ t \in \mathcal{T} \]

Store_opex

\[ \mathit{Store\_opex}_{\xi} = \sum_{t \in \mathcal{T}} \sum_{v \in \mathcal{V}} q_{\xi,t,v} \cdot \mathrm{c}^{q}_{\xi,t,v} \cdot \mathrm{w}_{t} \cdot \mathrm{w}^{y}_{\mathrm{snapshot\_period}(t)} + \sum_{t \in \mathcal{T}} \sum_{v \in \mathcal{V}} q_{\xi,t,v} \cdot q_{\xi,t,v} \cdot \mathrm{c}^{q,(2)}_{\xi,t,v} \cdot \mathrm{w}_{t} \cdot \mathrm{w}^{y}_{\mathrm{snapshot\_period}(t)} + \sum_{t \in \mathcal{T}} \sum_{v \in \mathcal{V}} e_{\xi,t,v} \cdot \mathrm{c}^{e}_{\xi,t,v} \cdot \mathrm{w}_{t} \cdot \mathrm{w}^{y}_{\mathrm{snapshot\_period}(t)} + \sum_{t \in \mathcal{T}} \sum_{v \in \mathcal{V}} \left( q_{\xi,t,v} + q^{-}_{\xi,t,v} \right) \cdot \mathrm{c}^{q,+}_{\xi,t,v} \cdot \mathrm{w}_{t} \cdot \mathrm{w}^{y}_{\mathrm{snapshot\_period}(t)} + \sum_{t \in \mathcal{T}} \sum_{v \in \mathcal{V}} q^{-}_{\xi,t,v} \cdot \mathrm{c}^{q,-}_{\xi,t,v} \cdot \mathrm{w}_{t} \cdot \mathrm{w}^{y}_{\mathrm{snapshot\_period}(t)} \qquad \forall\, \xi \in \Xi \]

energy_limit_weight

\[ \mathrm{energy\_limit\_weight}_{t} = \mathrm{w}^{\mathrm{gen}}_{t} \cdot \mathrm{w}^{\mathrm{yr}}_{\mathrm{snapshot\_period}(t)} \qquad \forall\, t \in \mathcal{T} \]

risk_weighted_opex

\[ \mathit{risk\_weighted\_opex} = \sum_{\xi \in \Xi} \pi_{\xi} \cdot \mathit{scenario\_opex}_{\xi} \]

scenario_opex

\[ \mathit{scenario\_opex}_{\xi} = \mathit{Generator\_opex}_{\xi} + \mathit{Link\_opex}_{\xi} + \mathit{Process\_opex}_{\xi} + \mathit{Store\_opex}_{\xi} \qquad \forall\, \xi \in \Xi \]

total_cost

\[ \mathit{total\_cost} = \mathit{risk\_weighted\_opex} \]

Objective

\[ \min \mathit{total\_cost} \]

Subject to

Bus_nodal_balance

\[ \mathit{Bus\_injection}_{n,\xi,t} = 0 \qquad \forall\, n \in \mathcal{N},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Bus\_attached}_{n,t} \]

Generator_e_sum_max

\[ \sum_{t \in \mathcal{T}} p_{g,\xi,t} \cdot \mathrm{energy\_limit\_weight}_{t} \le \overline{\mathrm{E}}_{g,\xi} \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi \,:\, \overline{\mathrm{E}}_{g,\xi} \text{ is defined} \wedge \lvert \{ t \in \mathcal{T} \,:\, \mathrm{on}_{g,t} \} \rvert > 0 \]

Generator_fix_p_lower

\[ p_{g,\xi,t} \ge \underline{\mathrm{p}}_{g,\xi,t} \cdot \mathrm{p}^{\mathrm{nom}}_{g,\xi} \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \neg \mathrm{ext}_{g} \wedge \neg \mathrm{com}_{g} \wedge \mathrm{on}_{g,t} \]

Generator_fix_p_upper

\[ p_{g,\xi,t} \le \overline{\mathrm{p}}_{g,\xi,t} \cdot \mathrm{p}^{\mathrm{nom}}_{g,\xi} \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \neg \mathrm{ext}_{g} \wedge \neg \mathrm{com}_{g} \wedge \mathrm{on}_{g,t} \]

Link_e_sum_max

\[ \sum_{t \in \mathcal{T}} f_{l,\xi,t} \cdot \mathrm{energy\_limit\_weight}_{t} \le \overline{\mathrm{E}}^{f}_{l,\xi} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi \,:\, \overline{\mathrm{E}}^{f}_{l,\xi} \text{ is defined} \wedge \lvert \{ t \in \mathcal{T} \,:\, \mathrm{on}^{f}_{l,t} \} \rvert > 0 \]

Link_e_sum_min

\[ \sum_{t \in \mathcal{T}} f_{l,\xi,t} \cdot \mathrm{energy\_limit\_weight}_{t} \ge \underline{\mathrm{E}}^{f}_{l,\xi} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi \,:\, \underline{\mathrm{E}}^{f}_{l,\xi} \text{ is defined} \wedge \lvert \{ t \in \mathcal{T} \,:\, \mathrm{on}^{f}_{l,t} \} \rvert > 0 \]

Link_fix_p_lower

\[ f_{l,\xi,t} \ge \underline{\mathrm{f}}_{l,\xi,t} \cdot \mathrm{f}^{\mathrm{nom}}_{l,\xi} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \neg \mathrm{ext}^{f}_{l} \wedge \neg \mathrm{com}^{f}_{l} \wedge \mathrm{on}^{f}_{l,t} \]

Link_fix_p_upper

\[ f_{l,\xi,t} \le \overline{\mathrm{f}}_{l,\xi,t} \cdot \mathrm{f}^{\mathrm{nom}}_{l,\xi} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \neg \mathrm{ext}^{f}_{l} \wedge \neg \mathrm{com}^{f}_{l} \wedge \mathrm{on}^{f}_{l,t} \]

Process_e_sum_max

\[ \sum_{t \in \mathcal{T}} z_{j,\xi,t} \cdot \mathrm{energy\_limit\_weight}_{t} \le \overline{\mathrm{E}}^{z}_{j,\xi} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi \,:\, \overline{\mathrm{E}}^{z}_{j,\xi} \text{ is defined} \wedge \lvert \{ t \in \mathcal{T} \,:\, \mathrm{on}^{z}_{j,t} \} \rvert > 0 \]

Process_e_sum_min

\[ \sum_{t \in \mathcal{T}} z_{j,\xi,t} \cdot \mathrm{energy\_limit\_weight}_{t} \ge \underline{\mathrm{E}}^{z}_{j,\xi} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi \,:\, \underline{\mathrm{E}}^{z}_{j,\xi} \text{ is defined} \wedge \lvert \{ t \in \mathcal{T} \,:\, \mathrm{on}^{z}_{j,t} \} \rvert > 0 \]

Process_fix_p_lower

\[ z_{j,\xi,t} \ge \underline{\mathrm{z}}_{j,\xi,t} \cdot \mathrm{z}^{\mathrm{nom}}_{j,\xi} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \neg \mathrm{ext}^{z}_{j} \wedge \neg \mathrm{com}^{z}_{j} \wedge \mathrm{on}^{z}_{j,t} \]

Process_fix_p_upper

\[ z_{j,\xi,t} \le \overline{\mathrm{z}}_{j,\xi,t} \cdot \mathrm{z}^{\mathrm{nom}}_{j,\xi} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \neg \mathrm{ext}^{z}_{j} \wedge \neg \mathrm{com}^{z}_{j} \wedge \mathrm{on}^{z}_{j,t} \]

Store_e_sum_max

\[ \sum_{t \in \mathcal{T}} q_{\xi,t,v} \cdot \mathrm{energy\_limit\_weight}_{t} \le \overline{\mathrm{E}}^{q}_{\xi,v} \qquad \forall\, \xi \in \Xi,\ v \in \mathcal{V} \,:\, \overline{\mathrm{E}}^{q}_{\xi,v} \text{ is defined} \wedge \lvert \{ t \in \mathcal{T} \,:\, \mathrm{on}^{e}_{t,v} \} \rvert > 0 \]

Store_e_sum_min

\[ \sum_{t \in \mathcal{T}} q_{\xi,t,v} \cdot \mathrm{energy\_limit\_weight}_{t} \ge \underline{\mathrm{E}}^{q}_{\xi,v} \qquad \forall\, \xi \in \Xi,\ v \in \mathcal{V} \,:\, \underline{\mathrm{E}}^{q}_{\xi,v} \text{ is defined} \wedge \lvert \{ t \in \mathcal{T} \,:\, \mathrm{on}^{e}_{t,v} \} \rvert > 0 \]

Store_energy_balance

\[ \mathit{Store\_energy\_carried\_in}_{\xi,t,v} - \frac{q_{\xi,t,v} \cdot \mathrm{w}^{\mathrm{sto}}_{t}}{\eta^{e,+}_{\xi,t,v}} + \left( \eta^{e,-}_{\xi,t,v} - \frac{1}{\eta^{e,+}_{\xi,t,v}} \right) \cdot q^{-}_{\xi,t,v} \cdot \mathrm{w}^{\mathrm{sto}}_{t} + \mathrm{inflow}^{e}_{\xi,t,v} \cdot \mathrm{w}^{\mathrm{sto}}_{t} = e_{\xi,t,v} \qquad \forall\, \xi \in \Xi,\ t \in \mathcal{T},\ v \in \mathcal{V} \,:\, \mathrm{on}^{e}_{t,v} \]

Store_fix_e_lower

\[ e_{\xi,t,v} \ge \underline{\mathrm{e}}_{\xi,t,v} \cdot \mathrm{e}^{\mathrm{nom}}_{\xi,v} \qquad \forall\, \xi \in \Xi,\ t \in \mathcal{T},\ v \in \mathcal{V} \,:\, \neg \mathrm{ext}^{e}_{v} \wedge \mathrm{on}^{e}_{t,v} \]

Store_fix_e_upper

\[ e_{\xi,t,v} \le \overline{\mathrm{e}}_{\xi,t,v} \cdot \mathrm{e}^{\mathrm{nom}}_{\xi,v} \qquad \forall\, \xi \in \Xi,\ t \in \mathcal{T},\ v \in \mathcal{V} \,:\, \neg \mathrm{ext}^{e}_{v} \wedge \mathrm{on}^{e}_{t,v} \]

Store_fix_p_store_lower

\[ q^{-}_{\xi,t,v} \ge 0 \qquad \forall\, \xi \in \Xi,\ t \in \mathcal{T},\ v \in \mathcal{V} \,:\, \neg \mathrm{ext}^{e}_{v} \wedge \mathrm{on}^{e}_{t,v} \]

Store_fix_p_store_upper

\[ q^{-}_{\xi,t,v} \le \mathrm{Store\_charge\_cap\_pu}_{\xi,t,v} \cdot \mathrm{e}^{\mathrm{nom}}_{\xi,v} \qquad \forall\, \xi \in \Xi,\ t \in \mathcal{T},\ v \in \mathcal{V} \,:\, \neg \mathrm{ext}^{e}_{v} \wedge \mathrm{on}^{e}_{t,v} \wedge \left( \neg \mathrm{split}^{e}_{\xi,v} \vee \mathrm{T}^{e}_{\xi,v} \text{ is defined} \right) \]

The spec, differential/pypsa/rungs/rung_77_energy_limits.yaml — the file projected onto what this rung builds:

version: 0
description: The file states a plain `n.optimize()`, its multi-period class under the `multi_investment_periods`
  keyword, and its stochastic class, which `n.set_scenarios(...)` sets. Every quantity chosen once the
  future is known (second-stage) spans the futures dispatch is chosen in (`scenario`). Capacity is chosen
  once, before the future is known, and paid at its expected cost in each investment `period` its build
  year and lifetime span. Operation is the expectation over the scenarios' weights, with a share priced
  at the worst-outcome mean cost (CVaR) only where a risk preference is set. A plain run's data has one
  scenario, one period, unit weights, no outage and every `active` flag true, so the problem is the standard
  one. On a security-constrained run, PyPSA copies each branch flow limit once per `outage`, and the outage
  factors, `active` flags and scenario weights come from data prep.
dimensions:
  breakpoint: {dtype: int, ordered: true, description: 'the corners of a piecewise-linear curve, in order.
      A curve runs over the breakpoints its data has rows for, so curves may differ in length'}
  bus: {description: network nodes}
  generator: {description: 'generating units, each on one bus'}
  link: {description: 'controllable connections, each from one bus to the buses it delivers to'}
  link_output: {description: 'a link''s output ports, one label per port a link declares. The labels are
      PyPSA''s `bus1`, `bus2`, … columns read long, data prep. A link of any number of output ports is
      then one term in the balance'}
  load: {description: 'demands, each on one bus'}
  period: {dtype: int, ordered: true, description: investment periods. It is PyPSA's `investment_periods`}
  process: {description: 'generalised multi-port converters, each with an internal power that every port
      draws or delivers at its own rate'}
  process_output: {description: 'a process''s ports, one label per port a process declares. The labels
      are PyPSA''s `bus0`, `bus1`, …, each with a signed `rate`, data prep. A process of any number of
      ports is then one term in the balance'}
  scenario: {description: 'the futures dispatch is chosen in, each with a weight'}
  snapshot: {dtype: datetime, ordered: true, description: dispatch periods}
  store: {description: 'pure energy stores, each on one bus'}
relations:
  Generator_bus: {key: generator, values: bus, description: the bus a generator sits on}
  Link_bus0: {key: link, values: bus, description: the bus a link leaves}
  Link_output_bus: {key: link_output, values: bus, description: 'the bus an output port delivers to. It
      is PyPSA''s `bus1`, `bus2`, … columns. A link of three output ports is three labels here rather
      than a third relation, so the file states any number of them'}
  Link_output_link: {key: link_output, values: link, description: the link an output port belongs to}
  Load_bus: {key: load, values: bus, description: the bus a load sits on}
  Process_output_bus: {key: process_output, values: bus, description: 'the bus a port draws from or delivers
      to. It is PyPSA''s `bus0`, `bus1`, … columns. A process of three ports is three labels here rather
      than a third relation, so the file states any number of them'}
  Process_output_process: {key: process_output, values: process, description: the process a port belongs
      to}
  Store_bus: {key: store, values: bus, description: the bus a store sits on}
  snapshot_period: {key: snapshot, values: period, description: the investment period a snapshot falls
      in}
parameters:
  Bus_attached:
    dims: [bus, snapshot]
    dtype: bool
    description: whether a load, a unit, a port or a branch that is active in the snapshot's period is
      attached to the bus, data prep. A bus nothing is attached to has no balance row
  Generator_active:
    dims: [generator, snapshot]
    dtype: bool
    description: whether a generator is active in a snapshot's period. It is PyPSA's `active`, from build
      year and lifetime, data prep
  Generator_active_asset:
    dims: [generator]
    dtype: bool
    description: whether a generator is one of PyPSA's `active_assets`, by its `active` flag alone, without
      build year and lifetime. A unit that is active in no snapshot of the horizon still counts. PyPSA
      refuses one that differs by scenario (`constants.py:54`)
  Generator_committable:
    dims: [generator]
    dtype: bool
    description: whether output is gated by an on/off status decision
  Generator_e_sum_max:
    dims: [generator, scenario]
    description: 'most energy over the horizon: a fuel or emission budget in energy terms. It is infinity
      where no cap is meant'
  Generator_marginal_cost:
    dims: [generator, scenario, snapshot]
    description: cost of one unit of output
  Generator_marginal_cost_curve_p:
    dims: [breakpoint, generator]
    missing: absent
    description: 'the output at each breakpoint of a generator''s piecewise `marginal_cost` curve: PyPSA''s
      `p_pu` breakpoints times `p_nom`, data prep. A generator with no curve has no rows'
  Generator_marginal_cost_quadratic:
    dims: [generator, scenario, snapshot]
    description: cost of the square of one unit of output
  Generator_p_max_pu:
    dims: [generator, scenario, snapshot]
    description: 'most output, per unit of nominal power: an availability profile'
  Generator_p_min_pu:
    dims: [generator, scenario, snapshot]
    description: least output, per unit of nominal power
  Generator_p_nom:
    dims: [generator, scenario]
    description: nominal power
  Generator_p_nom_extendable:
    dims: [generator]
    dtype: bool
    description: whether the nominal power is a decision
  Generator_sign:
    dims: [generator]
    description: the sign output enters its bus's balance with. It is PyPSA's `sign`, `1` unless given,
      `-1` for a unit that draws power. PyPSA refuses one that differs by scenario (`constants.py:46`)
  Link_active:
    dims: [link, snapshot]
    dtype: bool
    description: whether a link is active in a snapshot's period. It is PyPSA's `active`, data prep
  Link_committable:
    dims: [link]
    dtype: bool
    description: whether flow is gated by an on/off status decision
  Link_e_sum_max:
    dims: [link, scenario]
    description: most energy of its flow at `bus0`, the withdrawal there, over the horizon. It is infinity
      where no cap is meant
  Link_e_sum_min:
    dims: [link, scenario]
    description: least energy of its flow at `bus0`, the withdrawal there, over the horizon. It is minus
      infinity where no floor is meant
  Link_efficiency:
    dims: [link_output, scenario, snapshot]
    description: 'share of the flow that arrives at an output port, PyPSA''s `efficiency`, `efficiency2`,
      … read long: negative where that port consumes rather than delivers. Read at the snapshot the flow
      arrives, so a delayed port delivers at its arrival snapshot''s efficiency (`constraints.py:1575`)'
  Link_marginal_cost:
    dims: [link, scenario, snapshot]
    description: cost of one unit of flow
  Link_marginal_cost_quadratic:
    dims: [link, scenario, snapshot]
    description: cost of the square of one unit of flow
  Link_output_cyclic_delay:
    dims: [link_output]
    dtype: bool
    description: whether a delayed port's flow wraps from the end of its investment period (PyPSA's `cyclic_delay`,
      `cyclic_delay2`, …). Where it does not, the flow still in transit at each period's first snapshots
      is lost. The flag is the same in every scenario, as the delay is
  Link_output_delay:
    dims: [link_output]
    dtype: int
    description: snapshots a port's delivery lags its link's flow (PyPSA's `delay`, `delay2`, … read long).
      In data prep you divide it by the `snapshot_weightings.generators` value and round it up. It is
      zero for a port that delivers at once. A port has the same delay in every scenario, because PyPSA
      refuses a delay that differs by scenario (`constants.py:55`)
  Link_p_max_pu:
    dims: [link, scenario, snapshot]
    description: most flow, per unit of nominal power
  Link_p_min_pu:
    dims: [link, scenario, snapshot]
    description: 'least flow, per unit of nominal power: negative for a link that carries both ways'
  Link_p_nom:
    dims: [link, scenario]
    description: nominal power
  Link_p_nom_extendable:
    dims: [link]
    dtype: bool
    description: whether the nominal power is a decision
  Load_active:
    dims: [load]
    dtype: bool
    description: whether a load is active in the network, PyPSA's `active`. A load has no build year and
      no lifetime, so the flag is the same in every snapshot. PyPSA refuses one that differs by scenario
      (`constants.py:54`)
  Load_p_set:
    dims: [load, scenario, snapshot]
    description: demand
  Load_sign:
    dims: [load]
    description: the sign a load's demand enters its bus's balance with. It is PyPSA's `sign`, `-1` unless
      given, `1` for a load that feeds its bus. PyPSA refuses one that differs by scenario (`constants.py:46`)
  Process_active:
    dims: [process, snapshot]
    dtype: bool
    description: whether a process is active in a snapshot's period. It is PyPSA's `active`, data prep
  Process_committable:
    dims: [process]
    dtype: bool
    description: whether internal power is gated by an on/off status decision
  Process_e_sum_max:
    dims: [process, scenario]
    description: most energy of its internal power over the horizon. It is infinity where no cap is meant
  Process_e_sum_min:
    dims: [process, scenario]
    description: least energy of its internal power over the horizon. It is minus infinity where no floor
      is meant
  Process_marginal_cost:
    dims: [process, scenario, snapshot]
    description: cost of one unit of internal power
  Process_marginal_cost_quadratic:
    dims: [process, scenario, snapshot]
    description: cost of the square of one unit of internal power
  Process_output_cyclic_delay:
    dims: [process_output]
    dtype: bool
    description: whether a delayed port's transfer wraps from the end of its investment period (PyPSA's
      `cyclic_delay0`, `cyclic_delay1`, …). Where it does not, the energy still in transit at each period's
      first snapshots is lost. The flag is the same in every scenario, as the delay is
  Process_output_delay:
    dims: [process_output]
    dtype: int
    description: snapshots a port's transfer lags its process's internal power (PyPSA's `delay0`, `delay1`,
      … read long). In data prep you divide it by the `snapshot_weightings.generators` value and round
      it up. It is zero for a port that transfers at once. A port has the same delay in every scenario,
      as a link's port has
  Process_p_max_pu:
    dims: [process, scenario, snapshot]
    description: most internal power, per unit of nominal power
  Process_p_min_pu:
    dims: [process, scenario, snapshot]
    description: 'least internal power, per unit of nominal power: negative for a process that runs both
      ways'
  Process_p_nom:
    dims: [process, scenario]
    description: nominal internal power
  Process_p_nom_extendable:
    dims: [process]
    dtype: bool
    description: whether the nominal internal power is a decision
  Process_rate:
    dims: [process_output, scenario, snapshot]
    description: the energy a port draws or delivers per unit of internal power (PyPSA's `rate0`, `rate1`,
      … read long). It is negative where the port withdraws and positive where it injects. A link is a
      process whose `bus0` rate is minus one and whose output rates are its efficiencies. The rate at
      the snapshot the transfer arrives applies, so a delayed port transfers at its arrival snapshot's
      rate (`constraints.py:1575`)
  Store_active:
    dims: [snapshot, store]
    dtype: bool
    description: whether a store is active in a snapshot's period. It is PyPSA's `active`, data prep
  Store_e_cyclic:
    dims: [scenario, store]
    dtype: bool
    description: whether the horizon closes on itself instead of opening on the initial energy
  Store_e_cyclic_per_period:
    dims: [scenario, store]
    dtype: bool
    description: whether each investment period closes on itself instead of carrying its energy on to
      the next. It overrides `e_cyclic` and `e_initial_per_period`. PyPSA reads it only under `multi_investment_periods`.
      Otherwise you feed false in data prep
  Store_e_initial:
    dims: [scenario, store]
    description: energy held before the first snapshot
  Store_e_initial_per_period:
    dims: [scenario, store]
    dtype: bool
    description: whether each investment period opens on the initial energy instead of carrying the previous
      period's. PyPSA reads it only under `multi_investment_periods`. Otherwise you feed false in data
      prep
  Store_e_max_pu:
    dims: [scenario, snapshot, store]
    description: most energy held, per unit of nominal capacity
  Store_e_min_pu:
    dims: [scenario, snapshot, store]
    description: 'least energy held, per unit of nominal capacity: negative for a store that may go short'
  Store_e_nom:
    dims: [scenario, store]
    description: nominal energy capacity
  Store_e_nom_extendable:
    dims: [store]
    dtype: bool
    description: whether the nominal energy capacity is a decision
  Store_e_sum_max:
    dims: [scenario, store]
    description: most energy of its net dispatch over the horizon. It is infinity where no cap is meant
  Store_e_sum_min:
    dims: [scenario, store]
    description: least energy of its net dispatch over the horizon. It is minus infinity where no floor
      is meant
  Store_efficiency_dispatch:
    dims: [scenario, snapshot, store]
    description: share of the energy drawn down that reaches the bus
  Store_efficiency_store:
    dims: [scenario, snapshot, store]
    description: share of the power drawn from the bus that becomes energy held
  Store_inactive_snapshots:
    dims: [store]
    dtype: int
    description: how many snapshots a store is not active in. It is PyPSA's `(~active).sum()`, data prep.
      A cyclic store reaches back this many snapshots further, so it closes on the last snapshot it is
      active in
  Store_inflow:
    dims: [scenario, snapshot, store]
    description: energy arriving per hour, a river into a reservoir
  Store_marginal_cost:
    dims: [scenario, snapshot, store]
    description: cost of one unit of power delivered
  Store_marginal_cost_dispatch:
    dims: [scenario, snapshot, store]
    description: cost of one unit of discharge, `p + p_store`
  Store_marginal_cost_quadratic:
    dims: [scenario, snapshot, store]
    description: cost of the square of the net power delivered, so charging costs as much as delivering
  Store_marginal_cost_storage:
    dims: [scenario, snapshot, store]
    description: cost of one unit of energy held over one snapshot
  Store_marginal_cost_store:
    dims: [scenario, snapshot, store]
    description: cost of one unit of charging, `p_store`
  Store_max_hours:
    dims: [scenario, store]
    missing: absent
    description: energy capacity, as hours of discharge at the power rating. The rating is `e_nom / max_hours`.
      No value means PyPSA's default of infinity, and the store's power is then unbounded
  Store_opens_late:
    dims: [snapshot, store]
    dtype: bool
    description: whether a snapshot is the first a store is active in, where that is not the first of
      the horizon, data prep. It is PyPSA's `active.cumsum() == 1` over the snapshots it is active in,
      past the first snapshot. It is false in a run where every store is active throughout
  Store_p_min_pu:
    dims: [scenario, snapshot, store]
    description: most charging, per unit of the power rating, negated. It is PyPSA's `p_min_pu`, `-1`
      unless given, read only where `max_hours` has a value
  Store_retention:
    dims: [scenario, snapshot, store]
    description: share of energy kept over a snapshot. It is PyPSA's `(1 - standing_loss) ** elapsed hours`,
      data prep
  Store_sign:
    dims: [store]
    description: the sign the power a store delivers enters its bus's balance with. It is PyPSA's `sign`,
      `1` unless given. PyPSA refuses one that differs by scenario (`constants.py:46`)
  Store_split_dispatch:
    dims: [scenario, store]
    dtype: bool
    description: 'whether a store charges through `p_store` apart from its net dispatch `p`. It is PyPSA''s
      `split_dispatch()`: true where an efficiency differs from one, a cost applies to one direction only,
      or `cycles_max` is finite, in any snapshot (`stores.py:88-116`), data prep. Where it is false, `p_store`
      is held at zero and the charging bound applies to `p`'
  period_weight_objective:
    dims: [period]
    description: PyPSA's `investment_period_weightings.objective` — what a period's cost weighs. PyPSA
      reads it only under `multi_investment_periods`. Otherwise you feed one in data prep, whatever the
      column contains (`optimize.py:231-233`, `:293-297`)
  period_weight_years:
    dims: [period]
    description: PyPSA's `investment_period_weightings.years` — what a period's energy weighs in a `primary_energy`,
      `operational_limit` or `e_sum` row. PyPSA reads it only under `multi_investment_periods`. Otherwise
      you feed one in data prep
  scenario_weight:
    dims: [scenario]
    description: PyPSA's `scenario_weightings.weight` — the probability of a future
  snapshot_weightings_generators:
    dims: [snapshot]
    description: PyPSA's `snapshot_weightings.generators` — hours a snapshot weighs in an energy total
  snapshot_weightings_objective:
    dims: [snapshot]
    description: PyPSA's `snapshot_weightings.objective` — hours a snapshot weighs in the cost
  snapshot_weightings_stores:
    dims: [snapshot]
    description: PyPSA's `snapshot_weightings.stores` — hours a snapshot weighs in a storage balance
variables:
  Generator_p:
    dims: [generator, scenario, snapshot]
    where: Generator_active
    description: '`Generator-p` — output of a generator in a snapshot'
  Link_p:
    dims: [link, scenario, snapshot]
    where: Link_active
    description: '`Link-p` — PyPSA''s `p0`, the flow measured at the `Link_bus0` end. A positive value
      withdraws there and injects at every bus the link''s output ports deliver to'
  Process_p:
    dims: [process, scenario, snapshot]
    where: Process_active
    description: '`Process-p` — PyPSA''s internal power `p`. A positive value drives every port at its
      own rate, withdrawing where the rate is negative and injecting where it is positive'
  Store_e:
    dims: [scenario, snapshot, store]
    where: Store_active
    description: '`Store-e` — energy held at the end of a snapshot'
  Store_p:
    dims: [scenario, snapshot, store]
    where: Store_active
    description: '`Store-p` — net power delivered to the bus. Charging is negative'
  Store_p_store:
    dims: [scenario, snapshot, store]
    where: Store_active
    description: '`Store-p_store` — power drawn from the bus to charge, so that `p + p_store` is the discharge.
      It is held at zero by its rows where the store does not split its dispatch'
  Generator_marginal_cost_piecewise:
    dims: [generator, scenario, snapshot]
    where: Generator_marginal_cost_curve AND Generator_active
    description: '`Generator-marginal_cost_piecewise` — the running cost of a generator that pays along
      a curve, held above the curve'
constraints:
  Bus_nodal_balance:
    dims: [bus, scenario, snapshot]
    where: Bus_attached
    expression: Bus_injection == 0
    description: '`Bus-nodal_balance` — what is generated at a bus meets the load there, less half of
      every incident line''s and transformer''s loss. What is generated includes storage dispatch and
      stores. It is net of what the links take away, plus what arrives over them after losses and any
      delay at every port they deliver to. Each process port draws or delivers at its own rate, and each
      passive branch carries its flow. PyPSA dissipates a branch''s loss half at either end. Each generator,
      storage unit, store and load term enters with its component''s `sign` (`constraints.py:1480-1481`,
      `:1592`), and an inactive load not at all. A bus nothing is attached to has no row. PyPSA refuses
      one that carries load. The file states no assumption for it.'
  Generator_e_sum_max:
    dims: [generator, scenario]
    where: Generator_e_sum_max AND count(Generator_active, over=snapshot) > 0
    expression: sum(Generator_p * energy_limit_weight, over=snapshot) <= Generator_e_sum_max
    description: '`Generator-e_sum_max` — energy over the horizon, each period weighted by its years,
      is at most its budget. A budget of infinity is no row, and so is a generator active in no snapshot'
  Generator_fix_p_lower:
    dims: [generator, scenario, snapshot]
    where: not Generator_p_nom_extendable AND not Generator_committable AND Generator_active
    expression: Generator_p >= Generator_p_min_pu * Generator_p_nom
    description: '`Generator-fix-p-lower` — a fixed generator outputs at least its minimum'
  Generator_fix_p_upper:
    dims: [generator, scenario, snapshot]
    where: not Generator_p_nom_extendable AND not Generator_committable AND Generator_active
    expression: Generator_p <= Generator_p_max_pu * Generator_p_nom
    description: '`Generator-fix-p-upper` — a fixed generator outputs at most what is available'
  Link_e_sum_max:
    dims: [link, scenario]
    where: Link_e_sum_max AND count(Link_active, over=snapshot) > 0
    expression: sum(Link_p * energy_limit_weight, over=snapshot) <= Link_e_sum_max
    description: '`Link-e_sum_max` — energy withdrawn at `bus0` over the horizon, each period weighted
      by its years, is at most its budget. A budget of infinity is no row, and so is a link active in
      no snapshot'
  Link_e_sum_min:
    dims: [link, scenario]
    where: Link_e_sum_min AND count(Link_active, over=snapshot) > 0
    expression: sum(Link_p * energy_limit_weight, over=snapshot) >= Link_e_sum_min
    description: '`Link-e_sum_min` — energy withdrawn at `bus0` over the horizon, each period weighted
      by its years, is at least its floor. A floor of minus infinity is no row, and so is a link active
      in no snapshot'
  Link_fix_p_lower:
    dims: [link, scenario, snapshot]
    where: not Link_p_nom_extendable AND not Link_committable AND Link_active
    expression: Link_p >= Link_p_min_pu * Link_p_nom
    description: '`Link-fix-p-lower` — a fixed link carries at least its minimum, negative for the other
      way'
  Link_fix_p_upper:
    dims: [link, scenario, snapshot]
    where: not Link_p_nom_extendable AND not Link_committable AND Link_active
    expression: Link_p <= Link_p_max_pu * Link_p_nom
    description: '`Link-fix-p-upper` — a fixed link carries at most its nominal power'
  Process_e_sum_max:
    dims: [process, scenario]
    where: Process_e_sum_max AND count(Process_active, over=snapshot) > 0
    expression: sum(Process_p * energy_limit_weight, over=snapshot) <= Process_e_sum_max
    description: '`Process-e_sum_max` — energy of the internal power over the horizon, each period weighted
      by its years, is at most its budget. A budget of infinity is no row, and so is a process active
      in no snapshot'
  Process_e_sum_min:
    dims: [process, scenario]
    where: Process_e_sum_min AND count(Process_active, over=snapshot) > 0
    expression: sum(Process_p * energy_limit_weight, over=snapshot) >= Process_e_sum_min
    description: '`Process-e_sum_min` — energy of the internal power over the horizon, each period weighted
      by its years, is at least its floor. A floor of minus infinity is no row, and so is a process active
      in no snapshot'
  Process_fix_p_lower:
    dims: [process, scenario, snapshot]
    where: not Process_p_nom_extendable AND not Process_committable AND Process_active
    expression: Process_p >= Process_p_min_pu * Process_p_nom
    description: '`Process-fix-p-lower` — a fixed process runs at least its minimum, negative for the
      other way'
  Process_fix_p_upper:
    dims: [process, scenario, snapshot]
    where: not Process_p_nom_extendable AND not Process_committable AND Process_active
    expression: Process_p <= Process_p_max_pu * Process_p_nom
    description: '`Process-fix-p-upper` — a fixed process runs at most its nominal power'
  Store_e_sum_max:
    dims: [scenario, store]
    where: Store_e_sum_max AND count(Store_active, over=snapshot) > 0
    expression: sum(Store_p * energy_limit_weight, over=snapshot) <= Store_e_sum_max
    description: '`Store-e_sum_max` — net energy delivered over the horizon, each period weighted by its
      years, is at most its budget. A budget of infinity is no row, and so is a store active in no snapshot'
  Store_e_sum_min:
    dims: [scenario, store]
    where: Store_e_sum_min AND count(Store_active, over=snapshot) > 0
    expression: sum(Store_p * energy_limit_weight, over=snapshot) >= Store_e_sum_min
    description: '`Store-e_sum_min` — net energy delivered over the horizon, each period weighted by its
      years, is at least its floor. A floor of minus infinity is no row, and so is a store active in no
      snapshot'
  Store_energy_balance:
    dims: [scenario, snapshot, store]
    where: Store_active
    expression: ((Store_energy_carried_in - ((Store_p * snapshot_weightings_stores) / Store_efficiency_dispatch))
      + (((Store_efficiency_store - (1 / Store_efficiency_dispatch)) * Store_p_store) * snapshot_weightings_stores))
      + (Store_inflow * snapshot_weightings_stores) == Store_e
    description: '`Store-energy_balance` — the energy carried in, less the discharge drawn down before
      its efficiency, plus the charge after its own, plus inflow not spilled. The net dispatch `p` is
      the discharge less `p_store`, so `p_store` enters with both efficiencies (`constraints.py:2472-2476`)'
  Store_fix_e_lower:
    dims: [scenario, snapshot, store]
    where: not Store_e_nom_extendable AND Store_active
    expression: Store_e >= Store_e_min_pu * Store_e_nom
    description: '`Store-fix-e-lower` — a fixed store holds at least its floor'
  Store_fix_e_upper:
    dims: [scenario, snapshot, store]
    where: not Store_e_nom_extendable AND Store_active
    expression: Store_e <= Store_e_max_pu * Store_e_nom
    description: '`Store-fix-e-upper` — a fixed store holds at most its nominal capacity'
  Store_fix_p_store_lower:
    dims: [scenario, snapshot, store]
    where: NOT Store_e_nom_extendable AND Store_active
    expression: Store_p_store >= 0
    description: '`Store-fix-p_store-lower` — charging is non-negative'
  Store_fix_p_store_upper:
    dims: [scenario, snapshot, store]
    where: NOT Store_e_nom_extendable AND Store_active AND (NOT Store_split_dispatch OR Store_max_hours)
    expression: Store_p_store <= Store_charge_cap_pu * Store_e_nom
    description: '`Store-fix-p_store-upper` — a fixed store charges at most its power rating where it
      splits its dispatch, and not at all where it does not. A store that splits and has no `max_hours`
      has no row'
expressions:
  Bus_injection:
    dims: [bus, scenario, snapshot]
    expression: (((Generator_injection + Link_injection) + Load_injection) + Process_injection) + Store_injection
    description: what every component puts into a bus, less what it takes out of it. PyPSA writes each
      term into the balance, and a load on its right-hand side
  Generator_injection: {expression: 'sum(Generator_sign * Generator_p, over=generator, by=Generator_bus[bus])'}
  Generator_opex: {expression: 'sum(sum((Generator_running_cost * snapshot_weightings_objective) * at(period_weight_objective,
      by=snapshot_period[period]), over=generator), over=snapshot) + sum(sum((((Generator_p * Generator_p)
      * Generator_marginal_cost_quadratic) * snapshot_weightings_objective) * at(period_weight_objective,
      by=snapshot_period[period]), over=generator), over=snapshot)'}
  Generator_running_cost:
    dims: [generator, scenario, snapshot]
    description: 'what a generator''s output costs in a snapshot: the value read off its piecewise curve
      where it has one, and its linear `marginal_cost` otherwise. A curve replaces the linear cost, as
      PyPSA drops the unit from that term (`optimize.py:333-348`)'
    cases:
      curve: {when: Generator_marginal_cost_curve, expression: Generator_marginal_cost_piecewise}
    otherwise: Generator_p * Generator_marginal_cost
  Link_injection: {expression: '-sum(Link_p, over=link, by=Link_bus0[bus]) + sum(Link_output_arrival,
      over=link_output, by=Link_output_bus[bus])'}
  Link_opex: {expression: 'sum(sum(((Link_p * Link_marginal_cost) * snapshot_weightings_objective) * at(period_weight_objective,
      by=snapshot_period[period]), over=link), over=snapshot) + sum(sum((((Link_p * Link_p) * Link_marginal_cost_quadratic)
      * snapshot_weightings_objective) * at(period_weight_objective, by=snapshot_period[period]), over=link),
      over=snapshot)'}
  Link_output_arrival:
    dims: [link_output, scenario, snapshot]
    description: what a link delivers to an output port at a snapshot. It is its flow delayed by the port's
      `delay` within its investment period. It is multiplied by the port's efficiency at the snapshot
      the flow arrives. Where the port is `cyclic_delay`, the delayed flow wraps from the period's end.
      Where it is not, the flow still in transit at the period's first snapshots is lost. A port that
      does not delay (`delay` zero) delivers its flow unshifted, cyclic or not
    cases:
      wrapping: {when: Link_output_cyclic_delay, expression: 'shift(at(Link_p, by=Link_output_link[link]),
          along=snapshot, offset=Link_output_delay, edge=''wrap'', within=snapshot_period[period]) * Link_efficiency'}
    otherwise: shift(at(Link_p, by=Link_output_link[link]), along=snapshot, offset=Link_output_delay,
      edge=0, within=snapshot_period[period]) * Link_efficiency
  Load_demand:
    dims: [load, scenario, snapshot]
    description: what a load draws from its bus's balance. It is its demand times its sign where it is
      active, and nothing where it is not. PyPSA drops an inactive load from the balance (`constraints.py:1591-1592`)
    cases:
      active: {when: Load_active, expression: Load_sign * Load_p_set}
    otherwise: '0'
  Load_injection: {expression: 'sum(Load_demand, over=load, by=Load_bus[bus])'}
  Process_injection: {expression: 'sum(Process_output_arrival, over=process_output, by=Process_output_bus[bus])'}
  Process_opex: {expression: 'sum(sum(((Process_p * Process_marginal_cost) * snapshot_weightings_objective)
      * at(period_weight_objective, by=snapshot_period[period]), over=process), over=snapshot) + sum(sum((((Process_p
      * Process_p) * Process_marginal_cost_quadratic) * snapshot_weightings_objective) * at(period_weight_objective,
      by=snapshot_period[period]), over=process), over=snapshot)'}
  Process_output_arrival:
    dims: [process_output, scenario, snapshot]
    description: what a process transfers at a port at a snapshot. It is its internal power delayed by
      the port's `delay` within its investment period. It is multiplied by the port's rate at the snapshot
      the transfer arrives. Where the port is `cyclic_delay`, the delayed transfer wraps from the period's
      end. Where it is not, the energy still in transit at the period's first snapshots is lost. A port
      that does not delay (`delay` zero) transfers at once, cyclic or not
    cases:
      wrapping: {when: Process_output_cyclic_delay, expression: 'shift(at(Process_p, by=Process_output_process[process]),
          along=snapshot, offset=Process_output_delay, edge=''wrap'', within=snapshot_period[period])
          * Process_rate'}
    otherwise: shift(at(Process_p, by=Process_output_process[process]), along=snapshot, offset=Process_output_delay,
      edge=0, within=snapshot_period[period]) * Process_rate
  Store_charge_cap_pu:
    dims: [scenario, snapshot, store]
    description: the most charging through `p_store`, per unit of `e_nom`. It is `-p_min_pu / max_hours`
      for a store that splits its dispatch, and zero otherwise (`stores.py:79-86`)
    cases:
      split: {when: Store_split_dispatch, expression: -Store_p_min_pu / Store_max_hours}
    otherwise: '0'
  Store_energy_carried_in:
    dims: [scenario, snapshot, store]
    description: the energy a store opens a snapshot with. At the first snapshot it is active in, it is
      its last such snapshot's less standing loss where it is cyclic. Where it is not, it is the given
      initial energy, which no standing loss has touched yet. Otherwise it is the previous snapshot's
      less standing loss. A store built in a later period opens in that period, and a cyclic one that
      retires closes on its own last snapshot. Per period, the same holds with each investment period
      as the horizon
    cases:
      cyclic: {when: Store_e_cyclic AND NOT Store_e_cyclic_per_period AND NOT Store_e_initial_per_period
          AND (position(snapshot) == 0 OR Store_opens_late), expression: 'Store_retention * shift(shift(Store_e,
          along=snapshot, offset=1, edge=''wrap''), along=snapshot, offset=Store_inactive_snapshots, edge=''wrap'')'}
      opening: {when: NOT Store_e_cyclic AND NOT Store_e_cyclic_per_period AND NOT Store_e_initial_per_period
          AND (position(snapshot) == 0 OR Store_opens_late), expression: Store_e_initial}
      period_cyclic: {when: Store_e_cyclic_per_period, expression: 'Store_retention * shift(Store_e, along=snapshot,
          offset=1, edge=''wrap'', within=snapshot_period[period])'}
      period_opening: {when: 'Store_e_initial_per_period AND NOT Store_e_cyclic_per_period AND position(snapshot,
          within=snapshot_period[period]) == 0', expression: Store_e_initial}
    otherwise: Store_retention * shift(Store_e, along=snapshot, offset=1)
  Store_injection: {expression: 'sum(Store_sign * Store_p, over=store, by=Store_bus[bus])'}
  Store_opex: {expression: '(((sum(sum(((Store_p * Store_marginal_cost) * snapshot_weightings_objective)
      * at(period_weight_objective, by=snapshot_period[period]), over=store), over=snapshot) + sum(sum((((Store_p
      * Store_p) * Store_marginal_cost_quadratic) * snapshot_weightings_objective) * at(period_weight_objective,
      by=snapshot_period[period]), over=store), over=snapshot)) + sum(sum(((Store_e * Store_marginal_cost_storage)
      * snapshot_weightings_objective) * at(period_weight_objective, by=snapshot_period[period]), over=store),
      over=snapshot)) + sum(sum((((Store_p + Store_p_store) * Store_marginal_cost_dispatch) * snapshot_weightings_objective)
      * at(period_weight_objective, by=snapshot_period[period]), over=store), over=snapshot)) + sum(sum(((Store_p_store
      * Store_marginal_cost_store) * snapshot_weightings_objective) * at(period_weight_objective, by=snapshot_period[period]),
      over=store), over=snapshot)'}
  energy_limit_weight:
    dims: [snapshot]
    expression: snapshot_weightings_generators * at(period_weight_years, by=snapshot_period[period])
    description: 'what one unit of power at a snapshot counts for in an `e_sum` row: the generator weighting
      times the years of the snapshot''s period, as in an `operational_limit` row (`constraints.py:2935-2937`)'
  risk_weighted_opex: {expression: 'sum(scenario_weight * scenario_opex, over=scenario)'}
  scenario_opex:
    dims: [scenario]
    expression: ((Generator_opex + Link_opex) + Process_opex) + Store_opex
    description: 'what a future costs to run: every operating term, weighted by the snapshot''s hours
      and its period, before the scenario''s own weight. A start and a stop cost what they cost, unweighted,
      as PyPSA adds them (`optimize.py:448-468`)'
  total_cost:
    dims: []
    expression: risk_weighted_opex
    description: what the system costs. Capacity counts once per active period at its expected cost over
      the scenarios. Operation counts in expectation over the scenarios, and a share of it at the tail
conditions:
  Generator_marginal_cost_curve: {condition: 'count(Generator_marginal_cost_curve_p, over=breakpoint)
      > 0 AND Generator_active_asset', description: 'a generator that pays along a piecewise `marginal_cost`
      curve: one of PyPSA''s `active_assets` with curve data (`optimize.py:307`, `piecewise.py:230-257`)'}
objective: {sense: minimize, expression: total_cost}

The prep — every table the spec declares, from the network — and the solve:

from differential.pypsa.prep import relation, static, varying, weighting


def _cycle_periods(n: pypsa.Network, multi: bool) -> list[tuple[object, object]]:
    """``(label, investment_period)`` per period PyPSA builds cycles for — every period under ``multi_investment_periods``, else the one with no period, which takes every branch."""
    return [(p, p) for p in period_labels(n)] if multi else [(PLAIN_PERIOD, None)]


def _cycle_weights(n: pypsa.Network, multi: bool) -> dict[str, object]:
    """The KVL rows PyPSA itself writes, per period and branch — ``n.cycle_matrix(apply_weights=True)``, times the 1e5 PyPSA scales every cycle row by for conditioning.

    Each period has its own basis, of the branches standing in it, so a cycle
    label is a position in its period's basis. A branch whose weight is NaN — an
    extendable one at zero nominal rating, whose per-unit reactance is infinite
    — has no term: linopy drops it.

    A transformer's phase shift enters the same rows: a fixed one as a constant
    in radians at each snapshot of the period, a varying one as the shift
    decision times its cycle sign and π/180. PyPSA builds the basis from the
    first scenario only, and adds a shift only for a transformer that stands;
    a fixed shift of zero adds nothing and has no row.
    """
    n.determine_network_topology()
    n.calculate_dependent_values()
    transformers = first_scenario(n.static('Transformer'))
    varying_ = transformers['phase_shift_min'] < transformers['phase_shift_max']
    dense = get_switchable_as_dense(n, 'Transformer', 'phase_shift').set_axis(timesteps(n), axis=0)
    if dense.columns.nlevels > 1:
        dense = dense.T.groupby(level='name').first().T
    active = active_by_snapshot(n, 'Transformer')
    stamps = pd.Series(period_of(n) if multi else PLAIN_PERIOD, index=timesteps(n))
    rows: dict[str, list[dict]] = {'Line': [], 'Transformer': []}
    shift_rows, decision_rows = [], []
    basis: dict[object, set[str]] = {}
    for label, period in _cycle_periods(n, multi):
        weighted = n.cycle_matrix(investment_period=period, apply_weights=True) * 1e5
        if weighted.empty:
            continue
        basis[label] = {str(cycle) for cycle in weighted.columns}
        for (kind, name), weights in weighted.iterrows():
            rows.setdefault(kind, [])
            rows[kind].extend(
                {'period': label, DIM[kind]: str(name), 'cycle': str(cycle), 'value': float(w)}
                for cycle, w in weights.items()
                if w and not math.isnan(w)
            )
        plain = n.cycle_matrix(investment_period=period, apply_weights=False)
        if 'Transformer' not in plain.index.get_level_values(0):
            continue
        snapshots = stamps.index[stamps.to_numpy() == label]
        for name, signs in plain.loc['Transformer'].iterrows():
            for cycle, sign in signs.items():
                if not sign:
                    continue
                if varying_.get(name, False):
                    decision_rows.append(
                        {
                            'period': label,
                            'transformer': str(name),
                            'cycle': str(cycle),
                            'value': sign * math.pi / 180 * 1e5,
                        }
                    )
                    continue
                shift_rows.extend(
                    {
                        'snapshot': t,
                        'transformer': str(name),
                        'cycle': str(cycle),
                        'value': float(sign) * float(dense.at[t, name]) * math.pi / 180 * 1e5,
                    }
                    for t in snapshots
                    if dense.at[t, name] and active.at[t, name]
                )
    line = pd.DataFrame(rows['Line'], columns=['period', 'line', 'cycle', 'value']).astype({'value': float})
    transformer = pd.DataFrame(rows['Transformer'], columns=['period', 'transformer', 'cycle', 'value']).astype(
        {'value': float}
    )
    cycles = list(pd.unique(pd.concat([line['cycle'], transformer['cycle']])))
    return {
        'cycle': pl.Series('cycle', cycles, dtype=pl.String),
        'Cycle_in_basis': pd.DataFrame(
            [
                {'period': label, 'cycle': cycle, 'value': cycle in basis.get(label, set())}
                for label, _ in _cycle_periods(n, multi)
                for cycle in cycles
            ],
            columns=['period', 'cycle', 'value'],
        ).astype({'value': bool}),
        'Line_cycle_weight': line,
        'Transformer_cycle_weight': transformer,
        'Transformer_phase_shift_weight': pd.DataFrame(
            shift_rows, columns=['snapshot', 'transformer', 'cycle', 'value']
        ).astype({'value': float}),
        'Transformer_phase_shift_cycle_weight': _everywhere(
            pd.DataFrame(decision_rows, columns=['period', 'transformer', 'cycle', 'value']),
            {
                'period': [label for label, _ in _cycle_periods(n, multi)],
                'transformer': list(transformers.index.astype(str)),
                'cycle': cycles,
            },
        ),
        'Transformer_phase_shift_varying': per_component('Transformer', varying_, bool),
        'Transformer_phase_shift_min': per_component('Transformer', transformers['phase_shift_min']),
        'Transformer_phase_shift_max': per_component('Transformer', transformers['phase_shift_max']),
        'Transformer_phase_shift_fixed': long('Transformer', dense),
    }


def _everywhere(table: pd.DataFrame, labels: dict[str, list]) -> pd.DataFrame:
    """*table* with a zero at every combination of *labels* it has no row for — a table the file refuses to find short."""
    product = pd.MultiIndex.from_product(list(labels.values()), names=list(labels)).to_frame(index=False)
    return product.merge(table, on=list(labels), how='left').fillna({'value': 0.0}).astype({'value': float})


n = build()  # the network from the PyPSA tab

sources = {
    'bus': pl.Series('bus', list(names(n.buses.index).astype(str)), dtype=pl.String),
        **{
            dim: pl.Series(dim, list(names(n.static(component).index).astype(str)), dtype=pl.String)
            for component, dim in DIM.items()
        },
        **scenarios(n),
        **periods(n, multi),
        **carriers(n, multi),
    'snapshot': pl.Series('snapshot', list(timesteps(n)), dtype=pl.Datetime('us')),
    'Generator_bus': relation(n, 'Generator', 'bus'),
    'Link_bus0': relation(n, 'Link', 'bus0'),
    'Load_bus': relation(n, 'Load', 'bus'),
    'Store_bus': relation(n, 'Store', 'bus'),
    'Bus_attached': attached(n),
    'Generator_sign': per_component('Generator', first_scenario(n.generators['sign'])),
    'Load_active': per_component('Load', first_scenario(loads['active']), bool),
    'Load_p_set': varying(n, 'Load', 'p_set'),
    'Load_sign': per_component('Load', first_scenario(loads['sign'])),
    'snapshot_weightings_generators': weighting(n, 'generators'),
        **{name: table for component in DISPATCHABLE for name, table in dispatchable(n, component, optimize).items()},
        **ports(n, 'Link'),
        **ports(n, 'Process'),
        **storage(n, multi),
        **branches(n),
        **_cycle_weights(n, multi),
        **losses(n, optimize, outages),
        **security(n, outages, multi),
        **global_constraints(n, multi),
        **flow_based(n),
        **marginal_cost_curve(n),
    'snapshot_weightings_objective': weighting(n, 'objective'),
    'snapshot_weightings_stores': weighting(n, 'stores'),
}

with sps.solve('differential/pypsa/rungs/rung_77_energy_limits.yaml', sources) as solution:
    solution.objective  # 11618.75

The network, rung_77_energy_limits.py in the corpus — the spine plus what this rung adds:

# SPDX-FileCopyrightText: mathspec Contributors
#
# SPDX-License-Identifier: MIT

"""Rung 77: energy limits on every dispatching component — `e_sum_min` and `e_sum_max` on a generator, link, process and store, with each period weighted by its years."""

from __future__ import annotations

from datetime import datetime

import pandas as pd

OPTIMIZE = {'multi_investment_periods': True}


def build():
    """A whole network, not the spine: eight snapshots over two periods of unequal years, a cheap supply on a fuel bus, and four units under energy limits feeding a hub."""
    import pypsa

    n = pypsa.Network()
    n.snapshots = pd.MultiIndex.from_tuples(
        [(2020, datetime(2020, 1, 1, t)) for t in range(4)] + [(2030, datetime(2030, 1, 1, t)) for t in range(4)]
    )
    n.investment_periods = [2020, 2030]
    n.investment_period_weightings['objective'] = [1.0, 0.5]
    n.investment_period_weightings['years'] = [5.0, 10.0]
    n.snapshot_weightings['generators'] = [1.0, 2.0, 1.0, 2.0, 1.0, 2.0, 1.0, 2.0]
    n.add('Bus', ['fuel', 'hub'])
    n.add('Generator', 'well77', bus='fuel', p_nom=200, marginal_cost=1)
    n.add('Generator', 'cheap77', bus='hub', p_nom=50, marginal_cost=5, e_sum_max=2500)
    n.add('Generator', 'dear77', bus='hub', p_nom=200, marginal_cost=80)
    n.add('Link', 'pipe77', bus0='fuel', bus1='hub', p_nom=40, marginal_cost=90, e_sum_min=400, e_sum_max=5000)
    n.add(
        'Process',
        'plant77',
        bus0='fuel',
        bus1='hub',
        rate0=-1.25,
        p_nom=40,
        marginal_cost=6,
        e_sum_min=100,
        e_sum_max=1800,
    )
    n.add('Store', 'pile77', bus='hub', e_nom=200, e_initial=200, marginal_cost=3, e_sum_min=-50, e_sum_max=150)
    n.add('Load', 'hub_load77', bus='hub', p_set=[90, 110, 100, 80, 100, 120, 110, 90])
    return n
n = build()
n.optimize(solver_name='highs')
n.objective  # 11618.75

The data

The tables this rung is the first to declare (6), as the prep produced them:

Link_e_sum_max.csv

link,scenario,value
pipe77,base,5000.0

Link_e_sum_min.csv

link,scenario,value
pipe77,base,400.0

Process_e_sum_max.csv

process,scenario,value
plant77,base,1800.0

Process_e_sum_min.csv

process,scenario,value
plant77,base,100.0

Store_e_sum_max.csv

scenario,store,value
base,pile77,150.0

Store_e_sum_min.csv

scenario,store,value
base,pile77,-50.0