Skip to content

Rung 3: expansion — extendable capacity, energy-sum bounds, fixed and set nominal capacities

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 7633.908502024291 on both sides; structure ≠ tech_capacity_expansion_limit 5 vs 1+2+2 — one block per sense — ==, <=, >= — where PyPSA writes one row per labelled constraint whatever its sense; transmission_expansion_cost_limit 2 vs 1+1 — one block per sense — ==, <=, >= — where PyPSA writes one row per labelled constraint whatever its sense; size ✔ 200 rows · ✔ 81 columns · ✔ 344 nonzeros; duals ✔ 200 rows, 2 negated, 2 inside PyPSA's range; model for model: 62 blocks equal, 2 documented splits, 1 recorded deviations.

Rows and columns, PyPSA against specsolve, name for name
row PyPSA specsolve
Bus-nodal_balance 12 12
Generator-e_sum_max 1 1
Generator-e_sum_min 1 1
Generator-ext-p-lower 8 8
Generator-ext-p-upper 8 8
Generator-ext-p_nom-lower 2 2
Generator-ext-p_nom-upper 2 2
Generator-fix-p-lower 12 12
Generator-fix-p-upper 12 12
Generator-p-ramp_limit_down 3 3
Generator-p-ramp_limit_up 3 3
Generator-p_nom_set 1 1
Link-ext-p-lower 4 4
Link-ext-p-upper 4 4
Link-ext-p_nom-lower 1 1
Link-ext-p_nom-upper 1 1
Link-fix-p-lower 4 4
Link-fix-p-upper 4 4
Link-p-ramp_limit_down 3 3
Link-p-ramp_limit_up 3 3
Link-p_nom_set 1 1
StorageUnit-energy_balance 8 8
StorageUnit-ext-p_dispatch-lower 4 4
StorageUnit-ext-p_dispatch-upper 4 4
StorageUnit-ext-p_nom-lower 1 1
StorageUnit-ext-p_nom-upper 1 1
StorageUnit-ext-p_store-lower 4 4
StorageUnit-ext-p_store-upper 4 4
StorageUnit-ext-state_of_charge-lower 4 4
StorageUnit-ext-state_of_charge-upper 4 4
StorageUnit-fix-p_dispatch-lower 4 4
StorageUnit-fix-p_dispatch-upper 4 4
StorageUnit-fix-p_store-lower 4 4
StorageUnit-fix-p_store-upper 4 4
StorageUnit-fix-state_of_charge-lower 4 4
StorageUnit-fix-state_of_charge-upper 4 4
StorageUnit-p_nom_set 1 1
Store-e_nom_set 1 1
Store-energy_balance 8 8
Store-ext-e-lower 4 4
Store-ext-e-upper 4 4
Store-ext-e_nom-lower 1 1
Store-ext-e_nom-upper 1 1
Store-ext-p_store-lower 4 4
Store-ext-p_store-upper 4 4
Store-fix-e-lower 4 4
Store-fix-e-upper 4 4
Store-fix-p_store-lower 4 4
Store-fix-p_store-upper 4 4
tech_capacity_expansion_limit 5 ≠ 1+2+2
transmission_expansion_cost_limit 2 ≠ 1+1
transmission_volume_expansion_limit 1 1
column PyPSA specsolve
Generator-p 20 20
Generator-p_nom 2 2
Link-p 8 8
Link-p_nom 1 1
StorageUnit-p_dispatch 8 8
StorageUnit-p_nom 1 1
StorageUnit-p_store 8 8
StorageUnit-state_of_charge 8 8
Store-e 8 8
Store-e_nom 1 1
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{StorageUnit\_bus}: \mathcal{S} \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\) — global_constraint — PyPSA's GlobalConstraint rows, one label per declared limit
\(\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{S}\) index \(s\) — storage_unit with \(\mathrm{StorageUnit\_bus}: \mathcal{S} \to \mathcal{N}\) — storage units, dispatch and store behind one bus connection
\(\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{c}^{\mathrm{cap}}\) Generator_capital_cost over \(\mathcal{G} \times \Xi\) — cost of one unit of nominal power for the modelled horizon (PyPSA's periodized_cost), data prep. It is overnight_cost as an annuity over lifetime at discount_rate, times nyears, where overnight_cost is given, and capital_cost where it is not. Both add fom_cost (components.py:1157-1178, costs.py:102-203)
\(\mathrm{W}\) Generator_capital_weight over \(\mathcal{G}\) — the sum of period weights a generator is active in. It is PyPSA's active * period_weighting, summed, data prep
\(\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
\(\underline{\mathrm{E}}\) Generator_e_sum_min over \(\mathcal{G} \times \Xi\) — least energy over the horizon. It is minus infinity where no floor 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
\(\mathrm{N}^{\mathrm{fix}}\) Generator_modules_installed over \(\mathcal{G} \times \Xi\) — how many whole modules a committable build has in place, data prep. It is Generator_p_nom / Generator_p_nom_mod where a fixed build is modular, and one where it is not. PyPSA refuses a fixed modular build whose nominal power is not a whole number of modules
\(\mathrm{p}^{0}\) Generator_p_init over \(\mathcal{G} \times \Xi\), \(0\) where the data has no row — the output a unit brought into the horizon, data prep. It is PyPSA's p_init where the unit came in running, and zero where it came in off. Under a rolling horizon, it is the output the previous window solved. No value means it is unknown, and the unit then has no ramp row at the first snapshot
\(\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
\(\overline{\mathrm{p}}^{\mathrm{nom}}\) Generator_p_nom_max over \(\mathcal{G} \times \Xi\) — most nominal power an extendable generator may be built at
\(\underline{\mathrm{p}}^{\mathrm{nom}}\) Generator_p_nom_min over \(\mathcal{G} \times \Xi\) — least nominal power an extendable generator may be built at
\(\mathrm{p}^{\mathrm{mod}}\) Generator_p_nom_mod over \(\mathcal{G}\), absent where the data has no row — the module size a build comes in whole numbers of. No value means the build is continuous
\(\mathrm{p}^{\mathrm{nom,set}}\) Generator_p_nom_set over \(\mathcal{G}\), absent where the data has no row — a given nominal power for an extendable generator. One without a value has no row here
\(\mathrm{rd}\) Generator_ramp_limit_down over \(\mathcal{G} \times \Xi \times \mathcal{T}\), absent where the data has no row — most a generator may lower its output between snapshots, per unit of nominal power. No value means no limit. The value at the later of the two snapshots applies, so the limit may change over time
\(\mathrm{rd}^{\mathrm{dn}}\) Generator_ramp_limit_shut_down over \(\mathcal{G} \times \Xi\), absent where the data has no row — most output in the snapshot before a unit stops, per unit of nominal power. No value means no limit
\(\mathrm{ru}^{\mathrm{up}}\) Generator_ramp_limit_start_up over \(\mathcal{G} \times \Xi\), absent where the data has no row — most output in the snapshot a unit starts, per unit of nominal power. No value means no limit
\(\mathrm{ru}\) Generator_ramp_limit_up over \(\mathcal{G} \times \Xi \times \mathcal{T}\), absent where the data has no row — most a generator may raise its output between snapshots, per unit of nominal power. No value means no limit. The value at the later of the two snapshots applies, so the limit may change over time
\(\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{u}^{0}\) Generator_status_initial over \(\mathcal{G} \times \Xi\) — one where the unit was on before the first snapshot, zero where off. It is PyPSA's up_time_before > 0 for a committable unit, and one for a unit that is not, whose ramp rows PyPSA starts from on (constraints.py:323), data prep. Under a rolling horizon, it is the status the previous window solved, a fraction where unit commitment is linearised
\(\mathrm{m}\) Generator_tech_capacity_weight over \(\mathcal{G} \times \mathcal{L}\), absent where the data has no row — one where the generator is in the row's carrier-and-bus set, data prep. One outside it, or one that is not active in the row's investment_period, has no row
\(\mathrm{K}\) GlobalConstraint_constant over \(\mathcal{L} \times \Xi\) — the constant the total is held against. What a variable cannot represent is folded in here in data prep. That is an initial charge, times its period's years for each counted period where the storage reopens per period, or a non-extendable build. PyPSA reads it per scenario (global_constraints.py:577, :780, :859-864)
\(\mathrm{sense}\) GlobalConstraint_sense over \(\mathcal{L} \times \Xi\) — the row's sense in each scenario: <=, >= or ==. PyPSA reads a row's sense per scenario (global_constraints.py:576, :779, :859-864)
\(\mathrm{type}\) GlobalConstraint_type over \(\mathcal{L}\) — which formula the row takes: primary_energy, operational_limit, transmission_volume_expansion_limit, transmission_expansion_cost_limit, tech_capacity_expansion_limit or flow_based
\(\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{act}^{f}\) Link_active_asset over \(\mathcal{L}\) — whether a link 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{c}^{\mathrm{cap},f}\) Link_capital_cost over \(\mathcal{L} \times \Xi\) — cost of one unit of nominal power for the modelled horizon (PyPSA's periodized_cost), data prep. It is overnight_cost as an annuity over lifetime at discount_rate, times nyears, where overnight_cost is given, and capital_cost where it is not. Both add fom_cost (components.py:1157-1178, costs.py:102-203)
\(\mathrm{W}^{f}\) Link_capital_weight over \(\mathcal{L}\) — the sum of period weights a link is active in. It is PyPSA's active * period_weighting, summed, data prep
\(\mathrm{com}^{f}\) Link_committable over \(\mathcal{L}\) — whether flow is gated by an on/off status decision
\(\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{cc}^{f}\) Link_expansion_cost_weight over \(\mathcal{L} \times \mathcal{L} \times \Xi\), absent where the data has no row — the link's capital cost where its carrier is in the row's set, data prep. Where the row states no investment_period under multi_investment_periods, it is times the objective weights of the periods the link is active in. A link outside the set, or one that is not active in the row's period, has no row. The capital cost is PyPSA's capital_cost property, which is Link_capital_cost without fom_cost (components.py:1182-1200, global_constraints.py:905-914)
\(\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{N}^{f,\mathrm{fix}}\) Link_modules_installed over \(\mathcal{L} \times \Xi\) — how many whole modules a committable build has in place, data prep. It is Link_p_nom / Link_p_nom_mod where a fixed build is modular, and one where it is not. PyPSA refuses a fixed modular build whose nominal power is not a whole number of modules
\(\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)
\(\mathrm{f}^{0}\) Link_p_init over \(\mathcal{L} \times \Xi\), \(0\) where the data has no row — the flow a link brought into the horizon, data prep. It is PyPSA's p_init where the link came in running, and zero where it came in off. Under a rolling horizon, it is the flow the previous window solved. No value means it is unknown, and the link then has no ramp row at the first snapshot
\(\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
\(\overline{\mathrm{f}}^{\mathrm{nom}}\) Link_p_nom_max over \(\mathcal{L} \times \Xi\) — most nominal power an extendable link may be built at
\(\underline{\mathrm{f}}^{\mathrm{nom}}\) Link_p_nom_min over \(\mathcal{L} \times \Xi\) — least nominal power an extendable link may be built at
\(\mathrm{f}^{\mathrm{mod}}\) Link_p_nom_mod over \(\mathcal{L}\), absent where the data has no row — the module size a build comes in whole numbers of. No value means the build is continuous
\(\mathrm{f}^{\mathrm{nom,set}}\) Link_p_nom_set over \(\mathcal{L}\), absent where the data has no row — a given nominal power for an extendable link. One without a value has no row here
\(\mathrm{rd}^{f}\) Link_ramp_limit_down over \(\mathcal{L} \times \Xi \times \mathcal{T}\), absent where the data has no row — most a link may lower its flow between snapshots, per unit of nominal power. No value means no limit. The value at the later of the two snapshots applies, so the limit may change over time
\(\mathrm{rd}^{f,\mathrm{dn}}\) Link_ramp_limit_shut_down over \(\mathcal{L} \times \Xi\), absent where the data has no row — most flow in the snapshot before a link stops, per unit of nominal power. No value means no limit
\(\mathrm{ru}^{f,\mathrm{up}}\) Link_ramp_limit_start_up over \(\mathcal{L} \times \Xi\), absent where the data has no row — most flow in the snapshot a link starts, per unit of nominal power. No value means no limit
\(\mathrm{ru}^{f}\) Link_ramp_limit_up over \(\mathcal{L} \times \Xi \times \mathcal{T}\), absent where the data has no row — most a link may raise its flow between snapshots, per unit of nominal power. No value means no limit. The value at the later of the two snapshots applies, so the limit may change over time
\(\mathrm{u}^{f,0}\) Link_status_initial over \(\mathcal{L} \times \Xi\) — one where the link was on before the first snapshot, zero where off. It is PyPSA's up_time_before > 0 for a committable link, and one for a link that is not, whose ramp rows PyPSA starts from on (constraints.py:323), data prep. Under a rolling horizon, it is the status the previous window solved, a fraction where unit commitment is linearised
\(\mathrm{m}^{f}\) Link_tech_capacity_weight over \(\mathcal{L} \times \mathcal{L}\), absent where the data has no row — one where the link is in the row's carrier-and-bus set, data prep. One outside it, or one that is not active in the row's investment_period, has no row
\(\mathrm{len}^{f}\) Link_volume_weight over \(\mathcal{L} \times \mathcal{L} \times \Xi\), absent where the data has no row — the link's length in each scenario where its carrier is in the row's set (global_constraints.py:882-883), data prep. A link outside it, or one that is not active in the row's investment_period, has no row
\(\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{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
\(\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}^{h}\) StorageUnit_active over \(\mathcal{T} \times \mathcal{S}\) — whether a storage unit is active in a snapshot's period. It is PyPSA's active, data prep
\(\mathrm{act}^{h}\) StorageUnit_active_asset over \(\mathcal{S}\) — whether a storage unit 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{c}^{\mathrm{cap},h}\) StorageUnit_capital_cost over \(\Xi \times \mathcal{S}\) — cost of one unit of nominal power for the modelled horizon (PyPSA's periodized_cost), data prep. It is overnight_cost as an annuity over lifetime at discount_rate, times nyears, where overnight_cost is given, and capital_cost where it is not. Both add fom_cost (components.py:1157-1178, costs.py:102-203)
\(\mathrm{W}^{h}\) StorageUnit_capital_weight over \(\mathcal{S}\) — the sum of period weights a storage unit is active in. It is PyPSA's active * period_weighting, summed, data prep
\(\mathrm{cyc}\) StorageUnit_cyclic_state_of_charge over \(\Xi \times \mathcal{S}\) — whether the horizon closes on itself instead of opening on the initial charge
\(\mathrm{cyc}^{y}\) StorageUnit_cyclic_state_of_charge_per_period over \(\Xi \times \mathcal{S}\) — whether each investment period closes on itself instead of carrying its charge on to the next. It overrides cyclic_state_of_charge and state_of_charge_initial_per_period. PyPSA reads it only under multi_investment_periods. Otherwise you feed false in data prep
\(\eta^{+}\) StorageUnit_efficiency_dispatch over \(\Xi \times \mathcal{T} \times \mathcal{S}\) — share of the charge drawn down that reaches the bus
\(\eta^{-}\) StorageUnit_efficiency_store over \(\Xi \times \mathcal{T} \times \mathcal{S}\) — share of the power drawn from the bus that becomes charge
\(\mathrm{idle}\) StorageUnit_inactive_snapshots over \(\mathcal{S}\) — how many snapshots a storage unit is not active in. It is PyPSA's (~active).sum(), data prep. A cyclic unit reaches back this many snapshots further, so it closes on the last snapshot it is active in
\(\mathrm{inflow}\) StorageUnit_inflow over \(\Xi \times \mathcal{T} \times \mathcal{S}\) — energy arriving per hour, a river into a reservoir
\(\mathrm{c}^{h}\) StorageUnit_marginal_cost over \(\Xi \times \mathcal{T} \times \mathcal{S}\) — cost of one unit of dispatch
\(\mathrm{c}^{h,(2)}\) StorageUnit_marginal_cost_quadratic over \(\Xi \times \mathcal{T} \times \mathcal{S}\) — cost of the square of one unit of dispatch. Storing is not charged
\(\mathrm{c}^{\mathrm{soc}}\) StorageUnit_marginal_cost_storage over \(\Xi \times \mathcal{T} \times \mathcal{S}\) — cost of one unit of charge held over one snapshot
\(\mathrm{T}^{h}\) StorageUnit_max_hours over \(\Xi \times \mathcal{S}\) — energy capacity, as hours of dispatch at nominal power
\(\mathrm{open}\) StorageUnit_opens_late over \(\mathcal{T} \times \mathcal{S}\) — whether a snapshot is the first a storage unit 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 unit is active throughout
\(\overline{\mathrm{h}}\) StorageUnit_p_max_pu over \(\Xi \times \mathcal{T} \times \mathcal{S}\) — most dispatch, per unit of nominal power
\(\underline{\mathrm{h}}\) StorageUnit_p_min_pu over \(\Xi \times \mathcal{T} \times \mathcal{S}\) — most storing, per unit of nominal power and negated
\(\mathrm{h}^{\mathrm{nom}}\) StorageUnit_p_nom over \(\Xi \times \mathcal{S}\) — nominal power
\(\mathrm{ext}^{h}\) StorageUnit_p_nom_extendable over \(\mathcal{S}\) — whether the nominal power is a decision
\(\overline{\mathrm{h}}^{\mathrm{nom}}\) StorageUnit_p_nom_max over \(\Xi \times \mathcal{S}\) — most nominal power an extendable storage unit may be built at
\(\underline{\mathrm{h}}^{\mathrm{nom}}\) StorageUnit_p_nom_min over \(\Xi \times \mathcal{S}\) — least nominal power an extendable storage unit may be built at
\(\mathrm{h}^{\mathrm{nom,set}}\) StorageUnit_p_nom_set over \(\mathcal{S}\), absent where the data has no row — a given nominal power for an extendable storage unit. One without a value has no row here
\(\rho\) StorageUnit_retention over \(\Xi \times \mathcal{T} \times \mathcal{S}\) — share of charge kept over a snapshot. It is PyPSA's (1 - standing_loss) ** elapsed hours, data prep
\(\mathrm{sgn}^{h}\) StorageUnit_sign over \(\mathcal{S}\) — the sign net dispatch 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{soc}^{0}\) StorageUnit_state_of_charge_initial over \(\Xi \times \mathcal{S}\) — charge held before the first snapshot
\(\mathrm{reset}\) StorageUnit_state_of_charge_initial_per_period over \(\Xi \times \mathcal{S}\) — whether each investment period opens on the initial charge instead of carrying the previous period's. PyPSA reads it only under multi_investment_periods. Otherwise you feed false in data prep
\(\mathrm{m}^{h}\) StorageUnit_tech_capacity_weight over \(\mathcal{L} \times \mathcal{S}\), absent where the data has no row — one where the storage unit is in the row's carrier-and-bus set, data prep. One outside it, or one that is not active in the row's investment_period, has no row
\(\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{act}^{e}\) Store_active_asset over \(\mathcal{V}\) — whether a store 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{c}^{\mathrm{cap},e}\) Store_capital_cost over \(\Xi \times \mathcal{V}\) — cost of one unit of nominal capacity for the modelled horizon (PyPSA's periodized_cost), data prep. It is overnight_cost as an annuity over lifetime at discount_rate, times nyears, where overnight_cost is given, and capital_cost where it is not. Both add fom_cost (components.py:1157-1178, costs.py:102-203)
\(\mathrm{W}^{e}\) Store_capital_weight over \(\mathcal{V}\) — the sum of period weights a store is active in. It is PyPSA's active * period_weighting, summed, 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}}^{\mathrm{nom}}\) Store_e_nom_max over \(\Xi \times \mathcal{V}\) — most nominal capacity an extendable store may be built at
\(\underline{\mathrm{e}}^{\mathrm{nom}}\) Store_e_nom_min over \(\Xi \times \mathcal{V}\) — least nominal capacity an extendable store may be built at
\(\mathrm{e}^{\mathrm{nom,set}}\) Store_e_nom_set over \(\mathcal{V}\), absent where the data has no row — a given nominal capacity for an extendable store. One without a value has no row here
\(\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{m}^{e}\) Store_tech_capacity_weight over \(\mathcal{L} \times \mathcal{V}\), absent where the data has no row — one where the store is in the row's carrier-and-bus set, data prep. One outside it, or one that is not active in the row's investment_period, has no row
\(\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\_committed}\) Generator_committed over \(\mathcal{G} \times \mathcal{T}\) — a committable generator that is active in the snapshot's period: every unit-commitment row's set
\(\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)
\(\mathrm{Generator\_ramps\_from\_previous}\) Generator_ramps_from_previous over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — a snapshot whose ramp uses a previous output. It is any snapshot but its period's first, and the horizon's first where the generator comes in off or carries an initial output
\(\mathrm{Link\_committed}\) Link_committed over \(\mathcal{L} \times \mathcal{T}\) — a committable link that is active in the snapshot's period: every unit-commitment row's set
\(\mathrm{Link\_ramps\_from\_previous}\) Link_ramps_from_previous over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — a snapshot whose ramp uses a previous output. It is any snapshot but its period's first, and the horizon's first where the link comes in off or carries an initial output
\(\mathrm{StorageUnit\_ext}\) StorageUnit_ext over \(\mathcal{T} \times \mathcal{S}\) — a storage unit with an extendable build that is active in the snapshot's period. It is PyPSA's ext rows
\(\mathrm{StorageUnit\_fix}\) StorageUnit_fix over \(\mathcal{T} \times \mathcal{S}\) — a storage unit with a fixed build that is active in the snapshot's period. It is PyPSA's fix rows

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
\(P\) Generator_p_nom_ext over \(\mathcal{G}\) — Generator-p_nom — nominal power where it is a decision, for a generator that is active. A fixed build is the parameter of the same PyPSA name
\(u\) Generator_status over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — Generator-status — how much of a committable unit is on. It is an integer the rows below cap at one, or at the module count where the build is modular
\(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
\(F\) Link_p_nom_ext over \(\mathcal{L}\) — Link-p_nom — nominal power where it is a decision, for a link that is active. A fixed build is the parameter of the same PyPSA name
\(u^{f}\) Link_status over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — Link-status — how much of a committable link is on. It is an integer the rows below cap at one, or at the module count where the build is modular
\(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
\(h^{+}\) StorageUnit_p_dispatch over \(\Xi \times \mathcal{T} \times \mathcal{S}\) — StorageUnit-p_dispatch — power delivered to the bus
\(H\) StorageUnit_p_nom_ext over \(\mathcal{S}\) — StorageUnit-p_nom — nominal power where it is a decision, for a storage unit that is active. A fixed build is the parameter of the same PyPSA name
\(h^{-}\) StorageUnit_p_store over \(\Xi \times \mathcal{T} \times \mathcal{S}\) — StorageUnit-p_store — power drawn from the bus into charge
\(\mathit{soc}\) StorageUnit_state_of_charge over \(\Xi \times \mathcal{T} \times \mathcal{S}\) — StorageUnit-state_of_charge — energy held at the end of a snapshot
\(e\) Store_e over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — Store-e — energy held at the end of a snapshot
\(E\) Store_e_nom_ext over \(\mathcal{V}\) — Store-e_nom — nominal capacity where it is a decision, for a store that is active. A fixed build is the parameter of the same PyPSA name
\(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\_capex}\) Generator_capex (scalar)
\(\mathit{Generator\_injection}\) Generator_injection over \(\mathcal{N} \times \Xi \times \mathcal{T}\)
\(\mathit{Generator\_opex}\) Generator_opex over \(\Xi\)
\(\mathit{Generator\_p\_carried\_over}\) Generator_p_carried_over over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — the output a generator carries over into a snapshot. At the first, it is the p_init it brought in, which is zero where it came in off. After that, it is the previous snapshot's
\(\mathrm{Generator\_p\_nom\_committed}\) Generator_p_nom_committed over \(\mathcal{G} \times \Xi\) — the build a committed unit's ramp rows are taken against: one module where the build is modular, since its status counts modules, and the given build otherwise (constraints.py:1131-1134)
\(\mathit{Generator\_p\_nom\_effective}\) Generator_p_nom_effective over \(\mathcal{G} \times \Xi\) — the build a generator's limits are taken against: the chosen one where it is extendable, the given one otherwise
\(\mathit{Generator\_previous\_p}\) Generator_previous_p over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — the output a generator carries into a snapshot. It is nothing at the first snapshot it is active in past the first of the horizon: PyPSA fills an output it did not build with zero (constraints.py:716). It is the output carried over otherwise
\(\mathit{Generator\_previous\_status}\) Generator_previous_status over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — the commitment state a generator carries into a snapshot. It is off at the first snapshot it is active in past the first of the horizon. PyPSA reads a status it did not build as off there (constraints.py:391). It is the state carried over otherwise
\(\mathit{Generator\_ramp\_down\_allowance}\) Generator_ramp_down_allowance over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — how far a generator may lower output between two snapshots. It is its ramp limit of the build while it stays on, plus its shut-down ramp in the snapshot it turns off
\(\mathrm{Generator\_ramp\_down\_rate}\) Generator_ramp_down_rate over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — the ramp limit in a unit's down row, PyPSA's ramp_limit_down. It is the full build where PyPSA has none, since a shut-down ramp alone builds the row
\(\mathit{Generator\_ramp\_previous\_status}\) Generator_ramp_previous_status over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — the status a committed unit's ramp rows carry into a snapshot. At the first snapshot, a fixed modular unit that came in running has every module on, since the state it brought in is on or off (constraints.py:1152-1157). The transition and down-time rows count it as one module (PyPSA/PyPSA#2114). It is the state carried in otherwise
\(\mathit{Generator\_ramp\_up\_allowance}\) Generator_ramp_up_allowance over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — how far a generator may raise output between two snapshots. It is its ramp limit of the build while it stays on, plus its start-up ramp in the snapshot it turns on
\(\mathrm{Generator\_ramp\_up\_rate}\) Generator_ramp_up_rate over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — the ramp limit in a unit's up row, PyPSA's ramp_limit_up. It is the full build where PyPSA has none, since a start-up ramp alone builds the row
\(\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)
\(\mathrm{Generator\_shut\_down\_rate}\) Generator_shut_down_rate over \(\mathcal{G} \times \Xi\) — the shut-down ramp in a unit's down row (PyPSA's ramp_limit_shut_down), or the full build where it has none
\(\mathrm{Generator\_start\_up\_rate}\) Generator_start_up_rate over \(\mathcal{G} \times \Xi\) — the start-up ramp in a unit's up row (PyPSA's ramp_limit_start_up), or the full build where it has none
\(\mathit{Generator\_status\_carried\_over}\) Generator_status_carried_over over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — the state a generator carries over into a snapshot: the state it brought into the horizon at the first, the previous snapshot's after that
\(\mathit{Generator\_tech\_capacity\_expansion}\) Generator_tech_capacity_expansion over \(\mathcal{L}\)
\(\mathit{Link\_capex}\) Link_capex (scalar)
\(\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
\(\mathit{Link\_p\_carried\_over}\) Link_p_carried_over over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — the output a link carries over into a snapshot. At the first, it is the p_init it brought in, which is zero where it came in off. After that, it is the previous snapshot's
\(\mathrm{Link\_p\_nom\_committed}\) Link_p_nom_committed over \(\mathcal{L} \times \Xi\) — the build a committed link's ramp rows are taken against: one module where the build is modular, since its status counts modules, and the given build otherwise (constraints.py:1131-1134)
\(\mathit{Link\_p\_nom\_effective}\) Link_p_nom_effective over \(\mathcal{L} \times \Xi\) — the build a link's limits are taken against: the chosen one where it is extendable, the given one otherwise
\(\mathit{Link\_previous\_p}\) Link_previous_p over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — the output a link carries into a snapshot. It is nothing at the first snapshot it is active in past the first of the horizon: PyPSA fills an output it did not build with zero (constraints.py:716). It is the output carried over otherwise
\(\mathit{Link\_previous\_status}\) Link_previous_status over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — the commitment state a link carries into a snapshot. It is off at the first snapshot it is active in past the first of the horizon. PyPSA reads a status it did not build as off there (constraints.py:391). It is the state carried over otherwise
\(\mathit{Link\_ramp\_down\_allowance}\) Link_ramp_down_allowance over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — how far a link may lower flow between two snapshots. It is its ramp limit of the build while it stays on, plus its shut-down ramp in the snapshot it turns off
\(\mathrm{Link\_ramp\_down\_rate}\) Link_ramp_down_rate over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — the ramp limit in a link's down row, PyPSA's ramp_limit_down. It is the full build where PyPSA has none, since a shut-down ramp alone builds the row
\(\mathit{Link\_ramp\_previous\_status}\) Link_ramp_previous_status over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — the status a committed link's ramp rows carry into a snapshot. At the first snapshot, a fixed modular link that came in running has every module on, since the state it brought in is on or off (constraints.py:1152-1157). The transition and down-time rows count it as one module (PyPSA/PyPSA#2114). It is the state carried in otherwise
\(\mathit{Link\_ramp\_up\_allowance}\) Link_ramp_up_allowance over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — how far a link may raise flow between two snapshots. It is its ramp limit of the build while it stays on, plus its start-up ramp in the snapshot it turns on
\(\mathrm{Link\_ramp\_up\_rate}\) Link_ramp_up_rate over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — the ramp limit in a link's up row, PyPSA's ramp_limit_up. It is the full build where PyPSA has none, since a start-up ramp alone builds the row
\(\mathrm{Link\_shut\_down\_rate}\) Link_shut_down_rate over \(\mathcal{L} \times \Xi\) — the shut-down ramp in a link's down row (PyPSA's ramp_limit_shut_down), or the full build where it has none
\(\mathrm{Link\_start\_up\_rate}\) Link_start_up_rate over \(\mathcal{L} \times \Xi\) — the start-up ramp in a link's up row (PyPSA's ramp_limit_start_up), or the full build where it has none
\(\mathit{Link\_status\_carried\_over}\) Link_status_carried_over over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — the state a link carries over into a snapshot: the state it brought into the horizon at the first, the previous snapshot's after that
\(\mathit{Link\_tech\_capacity\_expansion}\) Link_tech_capacity_expansion over \(\mathcal{L}\)
\(\mathit{Link\_transmission\_expansion\_cost}\) Link_transmission_expansion_cost over \(\mathcal{L} \times \Xi\)
\(\mathit{Link\_transmission\_volume\_expansion}\) Link_transmission_volume_expansion over \(\mathcal{L} \times \Xi\)
\(\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\_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
\(\mathit{StorageUnit\_capex}\) StorageUnit_capex (scalar)
\(\mathit{StorageUnit\_charge\_carried\_in}\) StorageUnit_charge_carried_in over \(\Xi \times \mathcal{T} \times \mathcal{S}\) — the charge a unit 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 charge, which no standing loss has touched yet. Otherwise it is the previous snapshot's less standing loss. A unit 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{StorageUnit\_injection}\) StorageUnit_injection over \(\mathcal{N} \times \Xi \times \mathcal{T}\)
\(\mathit{StorageUnit\_opex}\) StorageUnit_opex over \(\Xi\)
\(\mathit{StorageUnit\_tech\_capacity\_expansion}\) StorageUnit_tech_capacity_expansion over \(\mathcal{L}\)
\(\mathit{Store\_capex}\) Store_capex (scalar)
\(\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\)
\(\mathit{Store\_tech\_capacity\_expansion}\) Store_tech_capacity_expansion over \(\mathcal{L}\)
\(\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{tech\_capacity\_expansion}\) tech_capacity_expansion over \(\mathcal{L}\) — what a tech_capacity_expansion_limit row totals: the chosen build of the row's carrier-and-bus set
\(\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
\(\mathit{transmission\_expansion\_cost}\) transmission_expansion_cost over \(\mathcal{L} \times \Xi\) — what a transmission_expansion_cost_limit row totals: capital cost times the chosen build of the row's branches
\(\mathit{transmission\_volume\_expansion}\) transmission_volume_expansion over \(\mathcal{L} \times \Xi\) — what a transmission_volume_expansion_limit row totals: length times the chosen build of the row's branches

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_committed

\[ \mathrm{Generator\_committed}_{g,t} \iff \mathrm{com}_{g} \wedge \mathrm{on}_{g,t} \qquad \forall\, g \in \mathcal{G},\ t \in \mathcal{T} \]

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} \]

Generator_ramps_from_previous

\[ \mathrm{Generator\_ramps\_from\_previous}_{g,\xi,t} \iff \mathrm{pos}_{\mathrm{snapshot\_period}(t)}(t) > 0 \vee \mathrm{pos}(t) = 0 \wedge \left( \mathrm{u}^{0}_{g,\xi} = 0 \vee \mathrm{p}^{0}_{g,\xi} \text{ is defined} \right) \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi,\ t \in \mathcal{T} \]

Link_committed

\[ \mathrm{Link\_committed}_{l,t} \iff \mathrm{com}^{f}_{l} \wedge \mathrm{on}^{f}_{l,t} \qquad \forall\, l \in \mathcal{L},\ t \in \mathcal{T} \]

Link_ramps_from_previous

\[ \mathrm{Link\_ramps\_from\_previous}_{l,\xi,t} \iff \mathrm{pos}_{\mathrm{snapshot\_period}(t)}(t) > 0 \vee \mathrm{pos}(t) = 0 \wedge \left( \mathrm{u}^{f,0}_{l,\xi} = 0 \vee \mathrm{f}^{0}_{l,\xi} \text{ is defined} \right) \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi,\ t \in \mathcal{T} \]

StorageUnit_ext

\[ \mathrm{StorageUnit\_ext}_{t,s} \iff \mathrm{ext}^{h}_{s} \wedge \mathrm{on}^{h}_{t,s} \qquad \forall\, t \in \mathcal{T},\ s \in \mathcal{S} \]

StorageUnit_fix

\[ \mathrm{StorageUnit\_fix}_{t,s} \iff \neg \mathrm{ext}^{h}_{s} \wedge \mathrm{on}^{h}_{t,s} \qquad \forall\, t \in \mathcal{T},\ s \in \mathcal{S} \]

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} \]

Generator_p_nom_ext

\[ P_{g} \in \mathbb{R} \qquad \forall\, g \in \mathcal{G} \,:\, \mathrm{ext}_{g} \wedge \mathrm{act}_{g} \]

Generator_status

\[ u_{g,\xi,t} \ge 0, u_{g,\xi,t} \in \mathbb{Z} \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Generator\_committed}_{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} \]

Link_p_nom_ext

\[ F_{l} \in \mathbb{R} \qquad \forall\, l \in \mathcal{L} \,:\, \mathrm{ext}^{f}_{l} \wedge \mathrm{act}^{f}_{l} \]

Link_status

\[ u^{f}_{l,\xi,t} \ge 0, u^{f}_{l,\xi,t} \in \mathbb{Z} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Link\_committed}_{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} \]

StorageUnit_p_dispatch

\[ h^{+}_{\xi,t,s} \in \mathbb{R} \qquad \forall\, \xi \in \Xi,\ t \in \mathcal{T},\ s \in \mathcal{S} \,:\, \mathrm{on}^{h}_{t,s} \]

StorageUnit_p_nom_ext

\[ H_{s} \in \mathbb{R} \qquad \forall\, s \in \mathcal{S} \,:\, \mathrm{ext}^{h}_{s} \wedge \mathrm{act}^{h}_{s} \]

StorageUnit_p_store

\[ h^{-}_{\xi,t,s} \in \mathbb{R} \qquad \forall\, \xi \in \Xi,\ t \in \mathcal{T},\ s \in \mathcal{S} \,:\, \mathrm{on}^{h}_{t,s} \]

StorageUnit_state_of_charge

\[ \mathit{soc}_{\xi,t,s} \in \mathbb{R} \qquad \forall\, \xi \in \Xi,\ t \in \mathcal{T},\ s \in \mathcal{S} \,:\, \mathrm{on}^{h}_{t,s} \]

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_e_nom_ext

\[ E_{v} \in \mathbb{R} \qquad \forall\, v \in \mathcal{V} \,:\, \mathrm{ext}^{e}_{v} \wedge \mathrm{act}^{e}_{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{StorageUnit\_injection}_{n,\xi,t} + \mathit{Store\_injection}_{n,\xi,t} \qquad \forall\, n \in \mathcal{N},\ \xi \in \Xi,\ t \in \mathcal{T} \]

Generator_capex

\[ \mathit{Generator\_capex} = \sum_{g \in \mathcal{G},\ \xi \in \Xi} \pi_{\xi} \cdot P_{g} \cdot \mathrm{c}^{\mathrm{cap}}_{g,\xi} \cdot \mathrm{W}_{g} \]

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_p_carried_over

\[ \mathit{Generator\_p\_carried\_over}_{g,\xi,t} = \begin{cases} \mathrm{p}^{0}_{g,\xi} & \text{if } \mathrm{pos}(t) = 0 \\ p_{g,\xi,t - 1} & \text{otherwise} \end{cases} \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi,\ t \in \mathcal{T} \]

Generator_p_nom_committed

\[ \mathrm{Generator\_p\_nom\_committed}_{g,\xi} = \begin{cases} \mathrm{p}^{\mathrm{mod}}_{g} & \text{if } \mathrm{p}^{\mathrm{mod}}_{g} > 0 \\ \mathrm{p}^{\mathrm{nom}}_{g,\xi} & \text{otherwise} \end{cases} \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi \]

Generator_p_nom_effective

\[ \mathit{Generator\_p\_nom\_effective}_{g,\xi} = \begin{cases} P_{g} & \text{if } \mathrm{ext}_{g} \\ \mathrm{p}^{\mathrm{nom}}_{g,\xi} & \text{otherwise} \end{cases} \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi \]

Generator_previous_p

\[ \mathit{Generator\_previous\_p}_{g,\xi,t} = \begin{cases} 0 & \text{if } \mathrm{pos}(t) > 0 \wedge \neg \mathrm{on}_{g,t - 1} \\ \mathit{Generator\_p\_carried\_over}_{g,\xi,t} & \text{otherwise} \end{cases} \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi,\ t \in \mathcal{T} \]

Generator_previous_status

\[ \mathit{Generator\_previous\_status}_{g,\xi,t} = \begin{cases} 0 & \text{if } \mathrm{pos}(t) > 0 \wedge \neg \mathrm{on}_{g,t - 1} \\ \mathit{Generator\_status\_carried\_over}_{g,\xi,t} & \text{otherwise} \end{cases} \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi,\ t \in \mathcal{T} \]

Generator_ramp_down_allowance

\[ \mathit{Generator\_ramp\_down\_allowance}_{g,\xi,t} = \begin{cases} \mathrm{Generator\_ramp\_down\_rate}_{g,\xi,t} \cdot \mathrm{Generator\_p\_nom\_committed}_{g,\xi} \cdot u_{g,\xi,t} + \mathrm{Generator\_shut\_down\_rate}_{g,\xi} \cdot \mathrm{Generator\_p\_nom\_committed}_{g,\xi} \cdot \left( \mathit{Generator\_ramp\_previous\_status}_{g,\xi,t} - u_{g,\xi,t} \right) & \text{if } \mathrm{com}_{g} \\ \mathrm{Generator\_ramp\_down\_rate}_{g,\xi,t} \cdot \mathit{Generator\_p\_nom\_effective}_{g,\xi} & \text{otherwise} \end{cases} \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi,\ t \in \mathcal{T} \]

Generator_ramp_down_rate

\[ \mathrm{Generator\_ramp\_down\_rate}_{g,\xi,t} = \begin{cases} \mathrm{rd}_{g,\xi,t} & \text{if } \mathrm{rd}_{g,\xi,t} \text{ is defined} \\ 1 & \text{otherwise} \end{cases} \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi,\ t \in \mathcal{T} \]

Generator_ramp_previous_status

\[ \mathit{Generator\_ramp\_previous\_status}_{g,\xi,t} = \begin{cases} \mathrm{u}^{0}_{g,\xi} \cdot \mathrm{N}^{\mathrm{fix}}_{g,\xi} & \text{if } \mathrm{pos}(t) = 0 \wedge \neg \mathrm{ext}_{g} \wedge \mathrm{p}^{\mathrm{mod}}_{g} > 0 \\ \mathit{Generator\_previous\_status}_{g,\xi,t} & \text{otherwise} \end{cases} \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi,\ t \in \mathcal{T} \]

Generator_ramp_up_allowance

\[ \mathit{Generator\_ramp\_up\_allowance}_{g,\xi,t} = \begin{cases} \mathrm{Generator\_ramp\_up\_rate}_{g,\xi,t} \cdot \mathrm{Generator\_p\_nom\_committed}_{g,\xi} \cdot \mathit{Generator\_ramp\_previous\_status}_{g,\xi,t} + \mathrm{Generator\_start\_up\_rate}_{g,\xi} \cdot \mathrm{Generator\_p\_nom\_committed}_{g,\xi} \cdot \left( u_{g,\xi,t} - \mathit{Generator\_ramp\_previous\_status}_{g,\xi,t} \right) & \text{if } \mathrm{com}_{g} \\ \mathrm{Generator\_ramp\_up\_rate}_{g,\xi,t} \cdot \mathit{Generator\_p\_nom\_effective}_{g,\xi} & \text{otherwise} \end{cases} \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi,\ t \in \mathcal{T} \]

Generator_ramp_up_rate

\[ \mathrm{Generator\_ramp\_up\_rate}_{g,\xi,t} = \begin{cases} \mathrm{ru}_{g,\xi,t} & \text{if } \mathrm{ru}_{g,\xi,t} \text{ is defined} \\ 1 & \text{otherwise} \end{cases} \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi,\ t \in \mathcal{T} \]

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} \]

Generator_shut_down_rate

\[ \mathrm{Generator\_shut\_down\_rate}_{g,\xi} = \begin{cases} \mathrm{rd}^{\mathrm{dn}}_{g,\xi} & \text{if } \mathrm{rd}^{\mathrm{dn}}_{g,\xi} \text{ is defined} \\ 1 & \text{otherwise} \end{cases} \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi \]

Generator_start_up_rate

\[ \mathrm{Generator\_start\_up\_rate}_{g,\xi} = \begin{cases} \mathrm{ru}^{\mathrm{up}}_{g,\xi} & \text{if } \mathrm{ru}^{\mathrm{up}}_{g,\xi} \text{ is defined} \\ 1 & \text{otherwise} \end{cases} \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi \]

Generator_status_carried_over

\[ \mathit{Generator\_status\_carried\_over}_{g,\xi,t} = \begin{cases} \mathrm{u}^{0}_{g,\xi} & \text{if } \mathrm{pos}(t) = 0 \\ u_{g,\xi,t - 1} & \text{otherwise} \end{cases} \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi,\ t \in \mathcal{T} \]

Generator_tech_capacity_expansion

\[ \mathit{Generator\_tech\_capacity\_expansion}_{l} = \sum_{g \in \mathcal{G}} P_{g} \cdot \mathrm{m}_{g,l} \qquad \forall\, l \in \mathcal{L} \]

Link_capex

\[ \mathit{Link\_capex} = \sum_{l \in \mathcal{L},\ \xi \in \Xi} \pi_{\xi} \cdot F_{l} \cdot \mathrm{c}^{\mathrm{cap},f}_{l,\xi} \cdot \mathrm{W}^{f}_{l} \]

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} \]

Link_p_carried_over

\[ \mathit{Link\_p\_carried\_over}_{l,\xi,t} = \begin{cases} \mathrm{f}^{0}_{l,\xi} & \text{if } \mathrm{pos}(t) = 0 \\ f_{l,\xi,t - 1} & \text{otherwise} \end{cases} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi,\ t \in \mathcal{T} \]

Link_p_nom_committed

\[ \mathrm{Link\_p\_nom\_committed}_{l,\xi} = \begin{cases} \mathrm{f}^{\mathrm{mod}}_{l} & \text{if } \mathrm{f}^{\mathrm{mod}}_{l} > 0 \\ \mathrm{f}^{\mathrm{nom}}_{l,\xi} & \text{otherwise} \end{cases} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi \]

Link_p_nom_effective

\[ \mathit{Link\_p\_nom\_effective}_{l,\xi} = \begin{cases} F_{l} & \text{if } \mathrm{ext}^{f}_{l} \\ \mathrm{f}^{\mathrm{nom}}_{l,\xi} & \text{otherwise} \end{cases} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi \]

Link_previous_p

\[ \mathit{Link\_previous\_p}_{l,\xi,t} = \begin{cases} 0 & \text{if } \mathrm{pos}(t) > 0 \wedge \neg \mathrm{on}^{f}_{l,t - 1} \\ \mathit{Link\_p\_carried\_over}_{l,\xi,t} & \text{otherwise} \end{cases} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi,\ t \in \mathcal{T} \]

Link_previous_status

\[ \mathit{Link\_previous\_status}_{l,\xi,t} = \begin{cases} 0 & \text{if } \mathrm{pos}(t) > 0 \wedge \neg \mathrm{on}^{f}_{l,t - 1} \\ \mathit{Link\_status\_carried\_over}_{l,\xi,t} & \text{otherwise} \end{cases} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi,\ t \in \mathcal{T} \]

Link_ramp_down_allowance

\[ \mathit{Link\_ramp\_down\_allowance}_{l,\xi,t} = \begin{cases} \mathrm{Link\_ramp\_down\_rate}_{l,\xi,t} \cdot \mathrm{Link\_p\_nom\_committed}_{l,\xi} \cdot u^{f}_{l,\xi,t} + \mathrm{Link\_shut\_down\_rate}_{l,\xi} \cdot \mathrm{Link\_p\_nom\_committed}_{l,\xi} \cdot \left( \mathit{Link\_ramp\_previous\_status}_{l,\xi,t} - u^{f}_{l,\xi,t} \right) & \text{if } \mathrm{com}^{f}_{l} \\ \mathrm{Link\_ramp\_down\_rate}_{l,\xi,t} \cdot \mathit{Link\_p\_nom\_effective}_{l,\xi} & \text{otherwise} \end{cases} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi,\ t \in \mathcal{T} \]

Link_ramp_down_rate

\[ \mathrm{Link\_ramp\_down\_rate}_{l,\xi,t} = \begin{cases} \mathrm{rd}^{f}_{l,\xi,t} & \text{if } \mathrm{rd}^{f}_{l,\xi,t} \text{ is defined} \\ 1 & \text{otherwise} \end{cases} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi,\ t \in \mathcal{T} \]

Link_ramp_previous_status

\[ \mathit{Link\_ramp\_previous\_status}_{l,\xi,t} = \begin{cases} \mathrm{u}^{f,0}_{l,\xi} \cdot \mathrm{N}^{f,\mathrm{fix}}_{l,\xi} & \text{if } \mathrm{pos}(t) = 0 \wedge \neg \mathrm{ext}^{f}_{l} \wedge \mathrm{f}^{\mathrm{mod}}_{l} > 0 \\ \mathit{Link\_previous\_status}_{l,\xi,t} & \text{otherwise} \end{cases} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi,\ t \in \mathcal{T} \]

Link_ramp_up_allowance

\[ \mathit{Link\_ramp\_up\_allowance}_{l,\xi,t} = \begin{cases} \mathrm{Link\_ramp\_up\_rate}_{l,\xi,t} \cdot \mathrm{Link\_p\_nom\_committed}_{l,\xi} \cdot \mathit{Link\_ramp\_previous\_status}_{l,\xi,t} + \mathrm{Link\_start\_up\_rate}_{l,\xi} \cdot \mathrm{Link\_p\_nom\_committed}_{l,\xi} \cdot \left( u^{f}_{l,\xi,t} - \mathit{Link\_ramp\_previous\_status}_{l,\xi,t} \right) & \text{if } \mathrm{com}^{f}_{l} \\ \mathrm{Link\_ramp\_up\_rate}_{l,\xi,t} \cdot \mathit{Link\_p\_nom\_effective}_{l,\xi} & \text{otherwise} \end{cases} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi,\ t \in \mathcal{T} \]

Link_ramp_up_rate

\[ \mathrm{Link\_ramp\_up\_rate}_{l,\xi,t} = \begin{cases} \mathrm{ru}^{f}_{l,\xi,t} & \text{if } \mathrm{ru}^{f}_{l,\xi,t} \text{ is defined} \\ 1 & \text{otherwise} \end{cases} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi,\ t \in \mathcal{T} \]

Link_shut_down_rate

\[ \mathrm{Link\_shut\_down\_rate}_{l,\xi} = \begin{cases} \mathrm{rd}^{f,\mathrm{dn}}_{l,\xi} & \text{if } \mathrm{rd}^{f,\mathrm{dn}}_{l,\xi} \text{ is defined} \\ 1 & \text{otherwise} \end{cases} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi \]

Link_start_up_rate

\[ \mathrm{Link\_start\_up\_rate}_{l,\xi} = \begin{cases} \mathrm{ru}^{f,\mathrm{up}}_{l,\xi} & \text{if } \mathrm{ru}^{f,\mathrm{up}}_{l,\xi} \text{ is defined} \\ 1 & \text{otherwise} \end{cases} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi \]

Link_status_carried_over

\[ \mathit{Link\_status\_carried\_over}_{l,\xi,t} = \begin{cases} \mathrm{u}^{f,0}_{l,\xi} & \text{if } \mathrm{pos}(t) = 0 \\ u^{f}_{l,\xi,t - 1} & \text{otherwise} \end{cases} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi,\ t \in \mathcal{T} \]

Link_tech_capacity_expansion

\[ \mathit{Link\_tech\_capacity\_expansion}_{l} = \sum_{l \in \mathcal{L}} F_{l} \cdot \mathrm{m}^{f}_{l,l} \qquad \forall\, l \in \mathcal{L} \]

Link_transmission_expansion_cost

\[ \mathit{Link\_transmission\_expansion\_cost}_{l,\xi} = \sum_{l \in \mathcal{L}} F_{l} \cdot \mathrm{cc}^{f}_{l,l,\xi} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi \]

Link_transmission_volume_expansion

\[ \mathit{Link\_transmission\_volume\_expansion}_{l,\xi} = \sum_{l \in \mathcal{L}} F_{l} \cdot \mathrm{len}^{f}_{l,l,\xi} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi \]

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_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} \]

StorageUnit_capex

\[ \mathit{StorageUnit\_capex} = \sum_{\xi \in \Xi,\ s \in \mathcal{S}} \pi_{\xi} \cdot H_{s} \cdot \mathrm{c}^{\mathrm{cap},h}_{\xi,s} \cdot \mathrm{W}^{h}_{s} \]

StorageUnit_charge_carried_in

\[ \mathit{StorageUnit\_charge\_carried\_in}_{\xi,t,s} = \begin{cases} \rho_{\xi,t,s} \cdot \mathit{soc}_{\xi,\left( t \ominus \mathrm{idle} \right) \ominus 1,s} & \text{if } \mathrm{cyc}_{\xi,s} \wedge \neg \mathrm{cyc}^{y}_{\xi,s} \wedge \neg \mathrm{reset}_{\xi,s} \wedge \left( \mathrm{pos}(t) = 0 \vee \mathrm{open}_{t,s} \right) \\ \mathrm{soc}^{0}_{\xi,s} & \text{if } \neg \mathrm{cyc}_{\xi,s} \wedge \neg \mathrm{cyc}^{y}_{\xi,s} \wedge \neg \mathrm{reset}_{\xi,s} \wedge \left( \mathrm{pos}(t) = 0 \vee \mathrm{open}_{t,s} \right) \\ \rho_{\xi,t,s} \cdot \mathit{soc}_{\xi,t \ominus^{\mathrm{snapshot\_period}(t)} 1,s} & \text{if } \mathrm{cyc}^{y}_{\xi,s} \\ \mathrm{soc}^{0}_{\xi,s} & \text{if } \mathrm{reset}_{\xi,s} \wedge \neg \mathrm{cyc}^{y}_{\xi,s} \wedge \mathrm{pos}_{\mathrm{snapshot\_period}(t)}(t) = 0 \\ \rho_{\xi,t,s} \cdot \mathit{soc}_{\xi,t - 1,s} & \text{otherwise} \end{cases} \qquad \forall\, \xi \in \Xi,\ t \in \mathcal{T},\ s \in \mathcal{S} \]

StorageUnit_injection

\[ \mathit{StorageUnit\_injection}_{n,\xi,t} = \sum_{s \in \mathcal{S} \,:\, \mathrm{StorageUnit\_bus}(s) = n} \mathrm{sgn}^{h}_{s} \cdot \left( h^{+}_{\xi,t,s} - h^{-}_{\xi,t,s} \right) \qquad \forall\, n \in \mathcal{N},\ \xi \in \Xi,\ t \in \mathcal{T} \]

StorageUnit_opex

\[ \mathit{StorageUnit\_opex}_{\xi} = \sum_{t \in \mathcal{T}} \sum_{s \in \mathcal{S}} h^{+}_{\xi,t,s} \cdot \mathrm{c}^{h}_{\xi,t,s} \cdot \mathrm{w}_{t} \cdot \mathrm{w}^{y}_{\mathrm{snapshot\_period}(t)} + \sum_{t \in \mathcal{T}} \sum_{s \in \mathcal{S}} h^{+}_{\xi,t,s} \cdot h^{+}_{\xi,t,s} \cdot \mathrm{c}^{h,(2)}_{\xi,t,s} \cdot \mathrm{w}_{t} \cdot \mathrm{w}^{y}_{\mathrm{snapshot\_period}(t)} + \sum_{t \in \mathcal{T}} \sum_{s \in \mathcal{S}} \mathit{soc}_{\xi,t,s} \cdot \mathrm{c}^{\mathrm{soc}}_{\xi,t,s} \cdot \mathrm{w}_{t} \cdot \mathrm{w}^{y}_{\mathrm{snapshot\_period}(t)} \qquad \forall\, \xi \in \Xi \]

StorageUnit_tech_capacity_expansion

\[ \mathit{StorageUnit\_tech\_capacity\_expansion}_{l} = \sum_{s \in \mathcal{S}} H_{s} \cdot \mathrm{m}^{h}_{l,s} \qquad \forall\, l \in \mathcal{L} \]

Store_capex

\[ \mathit{Store\_capex} = \sum_{\xi \in \Xi,\ v \in \mathcal{V}} \pi_{\xi} \cdot E_{v} \cdot \mathrm{c}^{\mathrm{cap},e}_{\xi,v} \cdot \mathrm{W}^{e}_{v} \]

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 \]

Store_tech_capacity_expansion

\[ \mathit{Store\_tech\_capacity\_expansion}_{l} = \sum_{v \in \mathcal{V}} E_{v} \cdot \mathrm{m}^{e}_{l,v} \qquad \forall\, l \in \mathcal{L} \]

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{StorageUnit\_opex}_{\xi} + \mathit{Store\_opex}_{\xi} \qquad \forall\, \xi \in \Xi \]

tech_capacity_expansion

\[ \mathit{tech\_capacity\_expansion}_{l} = \mathit{Generator\_tech\_capacity\_expansion}_{l} + \mathit{Link\_tech\_capacity\_expansion}_{l} + \mathit{StorageUnit\_tech\_capacity\_expansion}_{l} + \mathit{Store\_tech\_capacity\_expansion}_{l} \qquad \forall\, l \in \mathcal{L} \]

total_cost

\[ \mathit{total\_cost} = \mathit{Generator\_capex} + \mathit{Link\_capex} + \mathit{StorageUnit\_capex} + \mathit{Store\_capex} + \mathit{risk\_weighted\_opex} \]

transmission_expansion_cost

\[ \mathit{transmission\_expansion\_cost}_{l,\xi} = \mathit{Link\_transmission\_expansion\_cost}_{l,\xi} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi \]

transmission_volume_expansion

\[ \mathit{transmission\_volume\_expansion}_{l,\xi} = \mathit{Link\_transmission\_volume\_expansion}_{l,\xi} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi \]

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_e_sum_min

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

Generator_ext_p_lower

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

Generator_ext_p_nom_lower

\[ P_{g} \ge \underline{\mathrm{p}}^{\mathrm{nom}}_{g,\xi} \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi \,:\, \mathrm{ext}_{g} \wedge \mathrm{act}_{g} \]

Generator_ext_p_nom_upper

\[ P_{g} \le \overline{\mathrm{p}}^{\mathrm{nom}}_{g,\xi} \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi \,:\, \mathrm{ext}_{g} \wedge \mathrm{act}_{g} \wedge \overline{\mathrm{p}}^{\mathrm{nom}}_{g,\xi} \text{ is defined} \]

Generator_ext_p_upper

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

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} \]

Generator_p_nom_set

\[ P_{g} = \mathrm{p}^{\mathrm{nom,set}}_{g} \qquad \forall\, g \in \mathcal{G} \,:\, \mathrm{ext}_{g} \wedge \mathrm{act}_{g} \wedge \mathrm{p}^{\mathrm{nom,set}}_{g} \text{ is defined} \]

Generator_p_ramp_limit_down

\[ \mathit{Generator\_previous\_p}_{g,\xi,t} - p_{g,\xi,t} \le \mathit{Generator\_ramp\_down\_allowance}_{g,\xi,t} \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \left( \mathrm{rd}_{g,\xi,t} \text{ is defined} \vee \mathrm{rd}^{\mathrm{dn}}_{g,\xi} \text{ is defined} \right) \wedge \neg \left( \mathrm{com}_{g} \wedge \mathrm{ext}_{g} \wedge \neg \left( \mathrm{p}^{\mathrm{mod}}_{g} > 0 \right) \right) \wedge \mathrm{Generator\_ramps\_from\_previous}_{g,\xi,t} \wedge \mathrm{on}_{g,t} \]

Generator_p_ramp_limit_up

\[ p_{g,\xi,t} - \mathit{Generator\_previous\_p}_{g,\xi,t} \le \mathit{Generator\_ramp\_up\_allowance}_{g,\xi,t} \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \left( \mathrm{ru}_{g,\xi,t} \text{ is defined} \vee \mathrm{ru}^{\mathrm{up}}_{g,\xi} \text{ is defined} \right) \wedge \neg \left( \mathrm{com}_{g} \wedge \mathrm{ext}_{g} \wedge \neg \left( \mathrm{p}^{\mathrm{mod}}_{g} > 0 \right) \right) \wedge \mathrm{Generator\_ramps\_from\_previous}_{g,\xi,t} \wedge \mathrm{on}_{g,t} \]

GlobalConstraint_tech_capacity_expansion_limit_eq

\[ \mathit{tech\_capacity\_expansion}_{l} = \mathrm{K}_{l,\xi} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi \,:\, \mathrm{type}_{l} = \text{'}\mathrm{tech\_capacity\_expansion\_limit}\text{'} \wedge \mathrm{sense}_{l,\xi} = \text{'}\mathrm{==}\text{'} \]

GlobalConstraint_tech_capacity_expansion_limit_lb

\[ \mathit{tech\_capacity\_expansion}_{l} \ge \mathrm{K}_{l,\xi} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi \,:\, \mathrm{type}_{l} = \text{'}\mathrm{tech\_capacity\_expansion\_limit}\text{'} \wedge \mathrm{sense}_{l,\xi} = \text{'}\mathrm{>=}\text{'} \]

GlobalConstraint_tech_capacity_expansion_limit_ub

\[ \mathit{tech\_capacity\_expansion}_{l} \le \mathrm{K}_{l,\xi} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi \,:\, \mathrm{type}_{l} = \text{'}\mathrm{tech\_capacity\_expansion\_limit}\text{'} \wedge \mathrm{sense}_{l,\xi} = \text{'}\mathrm{<=}\text{'} \]

GlobalConstraint_transmission_expansion_cost_limit_eq

\[ \mathit{transmission\_expansion\_cost}_{l,\xi} = \mathrm{K}_{l,\xi} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi \,:\, \mathrm{type}_{l} = \text{'}\mathrm{transmission\_expansion\_cost\_limit}\text{'} \wedge \mathrm{sense}_{l,\xi} = \text{'}\mathrm{==}\text{'} \]

GlobalConstraint_transmission_expansion_cost_limit_lb

\[ \mathit{transmission\_expansion\_cost}_{l,\xi} \ge \mathrm{K}_{l,\xi} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi \,:\, \mathrm{type}_{l} = \text{'}\mathrm{transmission\_expansion\_cost\_limit}\text{'} \wedge \mathrm{sense}_{l,\xi} = \text{'}\mathrm{>=}\text{'} \]

GlobalConstraint_transmission_volume_expansion_limit_ub

\[ \mathit{transmission\_volume\_expansion}_{l,\xi} \le \mathrm{K}_{l,\xi} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi \,:\, \mathrm{type}_{l} = \text{'}\mathrm{transmission\_volume\_expansion\_limit}\text{'} \wedge \mathrm{sense}_{l,\xi} = \text{'}\mathrm{<=}\text{'} \]

Link_ext_p_lower

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

Link_ext_p_nom_lower

\[ F_{l} \ge \underline{\mathrm{f}}^{\mathrm{nom}}_{l,\xi} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi \,:\, \mathrm{ext}^{f}_{l} \wedge \mathrm{act}^{f}_{l} \]

Link_ext_p_nom_upper

\[ F_{l} \le \overline{\mathrm{f}}^{\mathrm{nom}}_{l,\xi} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi \,:\, \mathrm{ext}^{f}_{l} \wedge \mathrm{act}^{f}_{l} \wedge \overline{\mathrm{f}}^{\mathrm{nom}}_{l,\xi} \text{ is defined} \]

Link_ext_p_upper

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

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} \]

Link_p_nom_set

\[ F_{l} = \mathrm{f}^{\mathrm{nom,set}}_{l} \qquad \forall\, l \in \mathcal{L} \,:\, \mathrm{ext}^{f}_{l} \wedge \mathrm{act}^{f}_{l} \wedge \mathrm{f}^{\mathrm{nom,set}}_{l} \text{ is defined} \]

Link_p_ramp_limit_down

\[ \mathit{Link\_previous\_p}_{l,\xi,t} - f_{l,\xi,t} \le \mathit{Link\_ramp\_down\_allowance}_{l,\xi,t} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \left( \mathrm{rd}^{f}_{l,\xi,t} \text{ is defined} \vee \mathrm{rd}^{f,\mathrm{dn}}_{l,\xi} \text{ is defined} \right) \wedge \neg \left( \mathrm{com}^{f}_{l} \wedge \mathrm{ext}^{f}_{l} \wedge \neg \left( \mathrm{f}^{\mathrm{mod}}_{l} > 0 \right) \right) \wedge \mathrm{Link\_ramps\_from\_previous}_{l,\xi,t} \wedge \mathrm{on}^{f}_{l,t} \]

Link_p_ramp_limit_up

\[ f_{l,\xi,t} - \mathit{Link\_previous\_p}_{l,\xi,t} \le \mathit{Link\_ramp\_up\_allowance}_{l,\xi,t} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \left( \mathrm{ru}^{f}_{l,\xi,t} \text{ is defined} \vee \mathrm{ru}^{f,\mathrm{up}}_{l,\xi} \text{ is defined} \right) \wedge \neg \left( \mathrm{com}^{f}_{l} \wedge \mathrm{ext}^{f}_{l} \wedge \neg \left( \mathrm{f}^{\mathrm{mod}}_{l} > 0 \right) \right) \wedge \mathrm{Link\_ramps\_from\_previous}_{l,\xi,t} \wedge \mathrm{on}^{f}_{l,t} \]

StorageUnit_energy_balance

\[ \mathit{StorageUnit\_charge\_carried\_in}_{\xi,t,s} + \eta^{-}_{\xi,t,s} \cdot h^{-}_{\xi,t,s} \cdot \mathrm{w}^{\mathrm{sto}}_{t} - \frac{h^{+}_{\xi,t,s} \cdot \mathrm{w}^{\mathrm{sto}}_{t}}{\eta^{+}_{\xi,t,s}} + \mathrm{inflow}_{\xi,t,s} \cdot \mathrm{w}^{\mathrm{sto}}_{t} = \mathit{soc}_{\xi,t,s} \qquad \forall\, \xi \in \Xi,\ t \in \mathcal{T},\ s \in \mathcal{S} \,:\, \mathrm{on}^{h}_{t,s} \]

StorageUnit_ext_p_dispatch_lower

\[ h^{+}_{\xi,t,s} \ge 0 \qquad \forall\, \xi \in \Xi,\ t \in \mathcal{T},\ s \in \mathcal{S} \,:\, \mathrm{StorageUnit\_ext}_{t,s} \]

StorageUnit_ext_p_dispatch_upper

\[ h^{+}_{\xi,t,s} \le \overline{\mathrm{h}}_{\xi,t,s} \cdot H_{s} \qquad \forall\, \xi \in \Xi,\ t \in \mathcal{T},\ s \in \mathcal{S} \,:\, \mathrm{StorageUnit\_ext}_{t,s} \]

StorageUnit_ext_p_nom_lower

\[ H_{s} \ge \underline{\mathrm{h}}^{\mathrm{nom}}_{\xi,s} \qquad \forall\, \xi \in \Xi,\ s \in \mathcal{S} \,:\, \mathrm{ext}^{h}_{s} \wedge \mathrm{act}^{h}_{s} \]

StorageUnit_ext_p_nom_upper

\[ H_{s} \le \overline{\mathrm{h}}^{\mathrm{nom}}_{\xi,s} \qquad \forall\, \xi \in \Xi,\ s \in \mathcal{S} \,:\, \mathrm{ext}^{h}_{s} \wedge \mathrm{act}^{h}_{s} \wedge \overline{\mathrm{h}}^{\mathrm{nom}}_{\xi,s} \text{ is defined} \]

StorageUnit_ext_p_store_lower

\[ h^{-}_{\xi,t,s} \ge 0 \qquad \forall\, \xi \in \Xi,\ t \in \mathcal{T},\ s \in \mathcal{S} \,:\, \mathrm{StorageUnit\_ext}_{t,s} \]

StorageUnit_ext_p_store_upper

\[ h^{-}_{\xi,t,s} \le -\underline{\mathrm{h}}_{\xi,t,s} \cdot H_{s} \qquad \forall\, \xi \in \Xi,\ t \in \mathcal{T},\ s \in \mathcal{S} \,:\, \mathrm{StorageUnit\_ext}_{t,s} \]

StorageUnit_ext_state_of_charge_lower

\[ \mathit{soc}_{\xi,t,s} \ge 0 \qquad \forall\, \xi \in \Xi,\ t \in \mathcal{T},\ s \in \mathcal{S} \,:\, \mathrm{StorageUnit\_ext}_{t,s} \]

StorageUnit_ext_state_of_charge_upper

\[ \mathit{soc}_{\xi,t,s} \le \mathrm{T}^{h}_{\xi,s} \cdot H_{s} \qquad \forall\, \xi \in \Xi,\ t \in \mathcal{T},\ s \in \mathcal{S} \,:\, \mathrm{StorageUnit\_ext}_{t,s} \]

StorageUnit_fix_p_dispatch_lower

\[ h^{+}_{\xi,t,s} \ge 0 \qquad \forall\, \xi \in \Xi,\ t \in \mathcal{T},\ s \in \mathcal{S} \,:\, \mathrm{StorageUnit\_fix}_{t,s} \]

StorageUnit_fix_p_dispatch_upper

\[ h^{+}_{\xi,t,s} \le \overline{\mathrm{h}}_{\xi,t,s} \cdot \mathrm{h}^{\mathrm{nom}}_{\xi,s} \qquad \forall\, \xi \in \Xi,\ t \in \mathcal{T},\ s \in \mathcal{S} \,:\, \mathrm{StorageUnit\_fix}_{t,s} \]

StorageUnit_fix_p_store_lower

\[ h^{-}_{\xi,t,s} \ge 0 \qquad \forall\, \xi \in \Xi,\ t \in \mathcal{T},\ s \in \mathcal{S} \,:\, \mathrm{StorageUnit\_fix}_{t,s} \]

StorageUnit_fix_p_store_upper

\[ h^{-}_{\xi,t,s} \le -\underline{\mathrm{h}}_{\xi,t,s} \cdot \mathrm{h}^{\mathrm{nom}}_{\xi,s} \qquad \forall\, \xi \in \Xi,\ t \in \mathcal{T},\ s \in \mathcal{S} \,:\, \mathrm{StorageUnit\_fix}_{t,s} \]

StorageUnit_fix_state_of_charge_lower

\[ \mathit{soc}_{\xi,t,s} \ge 0 \qquad \forall\, \xi \in \Xi,\ t \in \mathcal{T},\ s \in \mathcal{S} \,:\, \mathrm{StorageUnit\_fix}_{t,s} \]

StorageUnit_fix_state_of_charge_upper

\[ \mathit{soc}_{\xi,t,s} \le \mathrm{T}^{h}_{\xi,s} \cdot \mathrm{h}^{\mathrm{nom}}_{\xi,s} \qquad \forall\, \xi \in \Xi,\ t \in \mathcal{T},\ s \in \mathcal{S} \,:\, \mathrm{StorageUnit\_fix}_{t,s} \]

StorageUnit_p_nom_set

\[ H_{s} = \mathrm{h}^{\mathrm{nom,set}}_{s} \qquad \forall\, s \in \mathcal{S} \,:\, \mathrm{ext}^{h}_{s} \wedge \mathrm{act}^{h}_{s} \wedge \mathrm{h}^{\mathrm{nom,set}}_{s} \text{ is defined} \]

Store_e_nom_set

\[ E_{v} = \mathrm{e}^{\mathrm{nom,set}}_{v} \qquad \forall\, v \in \mathcal{V} \,:\, \mathrm{ext}^{e}_{v} \wedge \mathrm{act}^{e}_{v} \wedge \mathrm{e}^{\mathrm{nom,set}}_{v} \text{ is defined} \]

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_ext_e_lower

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

Store_ext_e_nom_lower

\[ E_{v} \ge \underline{\mathrm{e}}^{\mathrm{nom}}_{\xi,v} \qquad \forall\, \xi \in \Xi,\ v \in \mathcal{V} \,:\, \mathrm{ext}^{e}_{v} \wedge \mathrm{act}^{e}_{v} \]

Store_ext_e_nom_upper

\[ E_{v} \le \overline{\mathrm{e}}^{\mathrm{nom}}_{\xi,v} \qquad \forall\, \xi \in \Xi,\ v \in \mathcal{V} \,:\, \mathrm{ext}^{e}_{v} \wedge \mathrm{act}^{e}_{v} \wedge \overline{\mathrm{e}}^{\mathrm{nom}}_{\xi,v} \text{ is defined} \]

Store_ext_e_upper

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

Store_ext_p_store_lower

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

Store_ext_p_store_upper

\[ q^{-}_{\xi,t,v} \le \mathrm{Store\_charge\_cap\_pu}_{\xi,t,v} \cdot E_{v} \qquad \forall\, \xi \in \Xi,\ t \in \mathcal{T},\ v \in \mathcal{V} \,:\, \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) \]

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_03_expansion.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'}
  global_constraint: {description: 'PyPSA''s `GlobalConstraint` rows, one label per declared limit'}
  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}
  storage_unit: {description: 'storage units, dispatch and store behind one bus connection'}
  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}
  StorageUnit_bus: {key: storage_unit, values: bus, description: the bus a storage unit sits on}
  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_capital_cost:
    dims: [generator, scenario]
    description: cost of one unit of nominal power for the modelled horizon (PyPSA's `periodized_cost`),
      data prep. It is `overnight_cost` as an annuity over `lifetime` at `discount_rate`, times `nyears`,
      where `overnight_cost` is given, and `capital_cost` where it is not. Both add `fom_cost` (`components.py:1157-1178`,
      `costs.py:102-203`)
  Generator_capital_weight:
    dims: [generator]
    description: the sum of period weights a generator is active in. It is PyPSA's `active * period_weighting`,
      summed, data prep
  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_e_sum_min:
    dims: [generator, scenario]
    description: least energy over the horizon. It is minus infinity where no floor 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_modules_installed:
    dims: [generator, scenario]
    description: how many whole modules a committable build has in place, data prep. It is `Generator_p_nom
      / Generator_p_nom_mod` where a fixed build is modular, and one where it is not. PyPSA refuses a
      fixed modular build whose nominal power is not a whole number of modules
  Generator_p_init:
    dims: [generator, scenario]
    missing: 0.0
    description: the output a unit brought into the horizon, data prep. It is PyPSA's `p_init` where the
      unit came in running, and zero where it came in off. Under a rolling horizon, it is the output the
      previous window solved. No value means it is unknown, and the unit then has no ramp row at the first
      snapshot
  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_p_nom_max:
    dims: [generator, scenario]
    description: most nominal power an extendable generator may be built at
  Generator_p_nom_min:
    dims: [generator, scenario]
    description: least nominal power an extendable generator may be built at
  Generator_p_nom_mod:
    dims: [generator]
    missing: absent
    description: the module size a build comes in whole numbers of. No value means the build is continuous
  Generator_p_nom_set:
    dims: [generator]
    missing: absent
    description: a given nominal power for an extendable generator. One without a value has no row here
  Generator_ramp_limit_down:
    dims: [generator, scenario, snapshot]
    missing: absent
    description: most a generator may lower its output between snapshots, per unit of nominal power. No
      value means no limit. The value at the later of the two snapshots applies, so the limit may change
      over time
  Generator_ramp_limit_shut_down:
    dims: [generator, scenario]
    missing: absent
    description: most output in the snapshot before a unit stops, per unit of nominal power. No value
      means no limit
  Generator_ramp_limit_start_up:
    dims: [generator, scenario]
    missing: absent
    description: most output in the snapshot a unit starts, per unit of nominal power. No value means
      no limit
  Generator_ramp_limit_up:
    dims: [generator, scenario, snapshot]
    missing: absent
    description: most a generator may raise its output between snapshots, per unit of nominal power. No
      value means no limit. The value at the later of the two snapshots applies, so the limit may change
      over time
  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`)
  Generator_status_initial:
    dims: [generator, scenario]
    description: one where the unit was on before the first snapshot, zero where off. It is PyPSA's `up_time_before
      > 0` for a committable unit, and one for a unit that is not, whose ramp rows PyPSA starts from on
      (`constraints.py:323`), data prep. Under a rolling horizon, it is the status the previous window
      solved, a fraction where unit commitment is linearised
  Generator_tech_capacity_weight:
    dims: [generator, global_constraint]
    missing: absent
    description: one where the generator is in the row's carrier-and-bus set, data prep. One outside it,
      or one that is not active in the row's `investment_period`, has no row
  GlobalConstraint_constant:
    dims: [global_constraint, scenario]
    description: the constant the total is held against. What a variable cannot represent is folded in
      here in data prep. That is an initial charge, times its period's years for each counted period where
      the storage reopens per period, or a non-extendable build. PyPSA reads it per scenario (`global_constraints.py:577`,
      `:780`, `:859-864`)
  GlobalConstraint_sense:
    dims: [global_constraint, scenario]
    dtype: str
    description: 'the row''s sense in each scenario: `<=`, `>=` or `==`. PyPSA reads a row''s sense per
      scenario (`global_constraints.py:576`, `:779`, `:859-864`)'
  GlobalConstraint_type:
    dims: [global_constraint]
    dtype: str
    description: 'which formula the row takes: `primary_energy`, `operational_limit`, `transmission_volume_expansion_limit`,
      `transmission_expansion_cost_limit`, `tech_capacity_expansion_limit` or `flow_based`'
  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_active_asset:
    dims: [link]
    dtype: bool
    description: whether a link 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`)
  Link_capital_cost:
    dims: [link, scenario]
    description: cost of one unit of nominal power for the modelled horizon (PyPSA's `periodized_cost`),
      data prep. It is `overnight_cost` as an annuity over `lifetime` at `discount_rate`, times `nyears`,
      where `overnight_cost` is given, and `capital_cost` where it is not. Both add `fom_cost` (`components.py:1157-1178`,
      `costs.py:102-203`)
  Link_capital_weight:
    dims: [link]
    description: the sum of period weights a link is active in. It is PyPSA's `active * period_weighting`,
      summed, data prep
  Link_committable:
    dims: [link]
    dtype: bool
    description: whether flow is gated by an on/off status decision
  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_expansion_cost_weight:
    dims: [global_constraint, link, scenario]
    missing: absent
    description: the link's capital cost where its carrier is in the row's set, data prep. Where the row
      states no `investment_period` under `multi_investment_periods`, it is times the objective weights
      of the periods the link is active in. A link outside the set, or one that is not active in the row's
      period, has no row. The capital cost is PyPSA's `capital_cost` property, which is `Link_capital_cost`
      without `fom_cost` (`components.py:1182-1200`, `global_constraints.py:905-914`)
  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_modules_installed:
    dims: [link, scenario]
    description: how many whole modules a committable build has in place, data prep. It is `Link_p_nom
      / Link_p_nom_mod` where a fixed build is modular, and one where it is not. PyPSA refuses a fixed
      modular build whose nominal power is not a whole number of modules
  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_init:
    dims: [link, scenario]
    missing: 0.0
    description: the flow a link brought into the horizon, data prep. It is PyPSA's `p_init` where the
      link came in running, and zero where it came in off. Under a rolling horizon, it is the flow the
      previous window solved. No value means it is unknown, and the link then has no ramp row at the first
      snapshot
  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
  Link_p_nom_max:
    dims: [link, scenario]
    description: most nominal power an extendable link may be built at
  Link_p_nom_min:
    dims: [link, scenario]
    description: least nominal power an extendable link may be built at
  Link_p_nom_mod:
    dims: [link]
    missing: absent
    description: the module size a build comes in whole numbers of. No value means the build is continuous
  Link_p_nom_set:
    dims: [link]
    missing: absent
    description: a given nominal power for an extendable link. One without a value has no row here
  Link_ramp_limit_down:
    dims: [link, scenario, snapshot]
    missing: absent
    description: most a link may lower its flow between snapshots, per unit of nominal power. No value
      means no limit. The value at the later of the two snapshots applies, so the limit may change over
      time
  Link_ramp_limit_shut_down:
    dims: [link, scenario]
    missing: absent
    description: most flow in the snapshot before a link stops, per unit of nominal power. No value means
      no limit
  Link_ramp_limit_start_up:
    dims: [link, scenario]
    missing: absent
    description: most flow in the snapshot a link starts, per unit of nominal power. No value means no
      limit
  Link_ramp_limit_up:
    dims: [link, scenario, snapshot]
    missing: absent
    description: most a link may raise its flow between snapshots, per unit of nominal power. No value
      means no limit. The value at the later of the two snapshots applies, so the limit may change over
      time
  Link_status_initial:
    dims: [link, scenario]
    description: one where the link was on before the first snapshot, zero where off. It is PyPSA's `up_time_before
      > 0` for a committable link, and one for a link that is not, whose ramp rows PyPSA starts from on
      (`constraints.py:323`), data prep. Under a rolling horizon, it is the status the previous window
      solved, a fraction where unit commitment is linearised
  Link_tech_capacity_weight:
    dims: [global_constraint, link]
    missing: absent
    description: one where the link is in the row's carrier-and-bus set, data prep. One outside it, or
      one that is not active in the row's `investment_period`, has no row
  Link_volume_weight:
    dims: [global_constraint, link, scenario]
    missing: absent
    description: the link's length in each scenario where its carrier is in the row's set (`global_constraints.py:882-883`),
      data prep. A link outside it, or one that is not active in the row's `investment_period`, has no
      row
  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_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_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`)
  StorageUnit_active:
    dims: [snapshot, storage_unit]
    dtype: bool
    description: whether a storage unit is active in a snapshot's period. It is PyPSA's `active`, data
      prep
  StorageUnit_active_asset:
    dims: [storage_unit]
    dtype: bool
    description: whether a storage unit 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`)
  StorageUnit_capital_cost:
    dims: [scenario, storage_unit]
    description: cost of one unit of nominal power for the modelled horizon (PyPSA's `periodized_cost`),
      data prep. It is `overnight_cost` as an annuity over `lifetime` at `discount_rate`, times `nyears`,
      where `overnight_cost` is given, and `capital_cost` where it is not. Both add `fom_cost` (`components.py:1157-1178`,
      `costs.py:102-203`)
  StorageUnit_capital_weight:
    dims: [storage_unit]
    description: the sum of period weights a storage unit is active in. It is PyPSA's `active * period_weighting`,
      summed, data prep
  StorageUnit_cyclic_state_of_charge:
    dims: [scenario, storage_unit]
    dtype: bool
    description: whether the horizon closes on itself instead of opening on the initial charge
  StorageUnit_cyclic_state_of_charge_per_period:
    dims: [scenario, storage_unit]
    dtype: bool
    description: whether each investment period closes on itself instead of carrying its charge on to
      the next. It overrides `cyclic_state_of_charge` and `state_of_charge_initial_per_period`. PyPSA
      reads it only under `multi_investment_periods`. Otherwise you feed false in data prep
  StorageUnit_efficiency_dispatch:
    dims: [scenario, snapshot, storage_unit]
    description: share of the charge drawn down that reaches the bus
  StorageUnit_efficiency_store:
    dims: [scenario, snapshot, storage_unit]
    description: share of the power drawn from the bus that becomes charge
  StorageUnit_inactive_snapshots:
    dims: [storage_unit]
    dtype: int
    description: how many snapshots a storage unit is not active in. It is PyPSA's `(~active).sum()`,
      data prep. A cyclic unit reaches back this many snapshots further, so it closes on the last snapshot
      it is active in
  StorageUnit_inflow:
    dims: [scenario, snapshot, storage_unit]
    description: energy arriving per hour, a river into a reservoir
  StorageUnit_marginal_cost:
    dims: [scenario, snapshot, storage_unit]
    description: cost of one unit of dispatch
  StorageUnit_marginal_cost_quadratic:
    dims: [scenario, snapshot, storage_unit]
    description: cost of the square of one unit of dispatch. Storing is not charged
  StorageUnit_marginal_cost_storage:
    dims: [scenario, snapshot, storage_unit]
    description: cost of one unit of charge held over one snapshot
  StorageUnit_max_hours:
    dims: [scenario, storage_unit]
    description: energy capacity, as hours of dispatch at nominal power
  StorageUnit_opens_late:
    dims: [snapshot, storage_unit]
    dtype: bool
    description: whether a snapshot is the first a storage unit 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 unit is active throughout
  StorageUnit_p_max_pu:
    dims: [scenario, snapshot, storage_unit]
    description: most dispatch, per unit of nominal power
  StorageUnit_p_min_pu:
    dims: [scenario, snapshot, storage_unit]
    description: most storing, per unit of nominal power and negated
  StorageUnit_p_nom:
    dims: [scenario, storage_unit]
    description: nominal power
  StorageUnit_p_nom_extendable:
    dims: [storage_unit]
    dtype: bool
    description: whether the nominal power is a decision
  StorageUnit_p_nom_max:
    dims: [scenario, storage_unit]
    description: most nominal power an extendable storage unit may be built at
  StorageUnit_p_nom_min:
    dims: [scenario, storage_unit]
    description: least nominal power an extendable storage unit may be built at
  StorageUnit_p_nom_set:
    dims: [storage_unit]
    missing: absent
    description: a given nominal power for an extendable storage unit. One without a value has no row
      here
  StorageUnit_retention:
    dims: [scenario, snapshot, storage_unit]
    description: share of charge kept over a snapshot. It is PyPSA's `(1 - standing_loss) ** elapsed hours`,
      data prep
  StorageUnit_sign:
    dims: [storage_unit]
    description: the sign net dispatch enters its bus's balance with. It is PyPSA's `sign`, `1` unless
      given. PyPSA refuses one that differs by scenario (`constants.py:46`)
  StorageUnit_state_of_charge_initial:
    dims: [scenario, storage_unit]
    description: charge held before the first snapshot
  StorageUnit_state_of_charge_initial_per_period:
    dims: [scenario, storage_unit]
    dtype: bool
    description: whether each investment period opens on the initial charge instead of carrying the previous
      period's. PyPSA reads it only under `multi_investment_periods`. Otherwise you feed false in data
      prep
  StorageUnit_tech_capacity_weight:
    dims: [global_constraint, storage_unit]
    missing: absent
    description: one where the storage unit is in the row's carrier-and-bus set, data prep. One outside
      it, or one that is not active in the row's `investment_period`, has no row
  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_active_asset:
    dims: [store]
    dtype: bool
    description: whether a store 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`)
  Store_capital_cost:
    dims: [scenario, store]
    description: cost of one unit of nominal capacity for the modelled horizon (PyPSA's `periodized_cost`),
      data prep. It is `overnight_cost` as an annuity over `lifetime` at `discount_rate`, times `nyears`,
      where `overnight_cost` is given, and `capital_cost` where it is not. Both add `fom_cost` (`components.py:1157-1178`,
      `costs.py:102-203`)
  Store_capital_weight:
    dims: [store]
    description: the sum of period weights a store is active in. It is PyPSA's `active * period_weighting`,
      summed, 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_nom_max:
    dims: [scenario, store]
    description: most nominal capacity an extendable store may be built at
  Store_e_nom_min:
    dims: [scenario, store]
    description: least nominal capacity an extendable store may be built at
  Store_e_nom_set:
    dims: [store]
    missing: absent
    description: a given nominal capacity for an extendable store. One without a value has no row here
  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`'
  Store_tech_capacity_weight:
    dims: [global_constraint, store]
    missing: absent
    description: one where the store is in the row's carrier-and-bus set, data prep. One outside it, or
      one that is not active in the row's `investment_period`, has no row
  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'
  Generator_p_nom_ext:
    dims: [generator]
    where: Generator_p_nom_extendable AND Generator_active_asset
    description: '`Generator-p_nom` — nominal power where it is a decision, for a generator that is active.
      A fixed build is the parameter of the same PyPSA name'
  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'
  Link_p_nom_ext:
    dims: [link]
    where: Link_p_nom_extendable AND Link_active_asset
    description: '`Link-p_nom` — nominal power where it is a decision, for a link that is active. A fixed
      build is the parameter of the same PyPSA name'
  StorageUnit_p_dispatch:
    dims: [scenario, snapshot, storage_unit]
    where: StorageUnit_active
    description: '`StorageUnit-p_dispatch` — power delivered to the bus'
  StorageUnit_p_nom_ext:
    dims: [storage_unit]
    where: StorageUnit_p_nom_extendable AND StorageUnit_active_asset
    description: '`StorageUnit-p_nom` — nominal power where it is a decision, for a storage unit that
      is active. A fixed build is the parameter of the same PyPSA name'
  StorageUnit_p_store:
    dims: [scenario, snapshot, storage_unit]
    where: StorageUnit_active
    description: '`StorageUnit-p_store` — power drawn from the bus into charge'
  StorageUnit_state_of_charge:
    dims: [scenario, snapshot, storage_unit]
    where: StorageUnit_active
    description: '`StorageUnit-state_of_charge` — energy held at the end of a snapshot'
  Store_e:
    dims: [scenario, snapshot, store]
    where: Store_active
    description: '`Store-e` — energy held at the end of a snapshot'
  Store_e_nom_ext:
    dims: [store]
    where: Store_e_nom_extendable AND Store_active_asset
    description: '`Store-e_nom` — nominal capacity where it is a decision, for a store that is active.
      A fixed build is the parameter of the same PyPSA name'
  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_status:
    dims: [generator, scenario, snapshot]
    where: Generator_committed
    bounds: {lower: 0.0}
    domain: integer
    description: '`Generator-status` — how much of a committable unit is on. It is an integer the rows
      below cap at one, or at the module count where the build is modular'
  Link_status:
    dims: [link, scenario, snapshot]
    where: Link_committed
    bounds: {lower: 0.0}
    domain: integer
    description: '`Link-status` — how much of a committable link is on. It is an integer the rows below
      cap at one, or at the module count where the build is modular'
  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'
  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_e_sum_min:
    dims: [generator, scenario]
    where: Generator_e_sum_min AND count(Generator_active, over=snapshot) > 0
    expression: sum(Generator_p * energy_limit_weight, over=snapshot) >= Generator_e_sum_min
    description: '`Generator-e_sum_min` — energy 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 generator active in no snapshot'
  Generator_ext_p_lower:
    dims: [generator, scenario, snapshot]
    where: Generator_p_nom_extendable AND not Generator_committable AND Generator_active
    expression: Generator_p >= Generator_p_min_pu * Generator_p_nom_ext
    description: '`Generator-ext-p-lower` — an extendable generator outputs at least its minimum of the
      chosen build'
  Generator_ext_p_nom_lower:
    dims: [generator, scenario]
    where: Generator_p_nom_extendable AND Generator_active_asset
    expression: Generator_p_nom_ext >= Generator_p_nom_min
    description: '`Generator-ext-p_nom-lower` — the chosen build is at least its floor in every scenario'
  Generator_ext_p_nom_upper:
    dims: [generator, scenario]
    where: Generator_p_nom_extendable AND Generator_active_asset AND Generator_p_nom_max
    expression: Generator_p_nom_ext <= Generator_p_nom_max
    description: '`Generator-ext-p_nom-upper` — the chosen build is at most its cap in every scenario.
      A cap of infinity is no row'
  Generator_ext_p_upper:
    dims: [generator, scenario, snapshot]
    where: Generator_p_nom_extendable AND not Generator_committable AND Generator_active
    expression: Generator_p <= Generator_p_max_pu * Generator_p_nom_ext
    description: '`Generator-ext-p-upper` — an extendable generator outputs at most what is available
      of the chosen build'
  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'
  Generator_p_nom_set:
    dims: [generator]
    where: Generator_p_nom_extendable AND Generator_active_asset AND Generator_p_nom_set
    expression: Generator_p_nom_ext == Generator_p_nom_set
    description: '`Generator-p_nom_set` — the chosen build pinned, wherever a value is given'
  Generator_p_ramp_limit_down:
    dims: [generator, scenario, snapshot]
    where: (Generator_ramp_limit_down OR Generator_ramp_limit_shut_down) AND NOT (Generator_committable
      AND Generator_p_nom_extendable AND NOT (Generator_p_nom_mod > 0)) AND Generator_ramps_from_previous
      AND Generator_active
    expression: Generator_previous_p - Generator_p <= Generator_ramp_down_allowance
    description: '`Generator-p-ramp_limit_down` — a generator lowers output no faster than its ramp limit
      of the build. A committed one lowers it no further than its shut-down ramp in the snapshot it turns
      off. A unit that came into the horizon running has a row at the first snapshot only where its `p_init`
      gives the output it brought in. No unit has one at the start of a later investment period, nor does
      any unit a big M releases instead'
  Generator_p_ramp_limit_up:
    dims: [generator, scenario, snapshot]
    where: (Generator_ramp_limit_up OR Generator_ramp_limit_start_up) AND NOT (Generator_committable AND
      Generator_p_nom_extendable AND NOT (Generator_p_nom_mod > 0)) AND Generator_ramps_from_previous
      AND Generator_active
    expression: Generator_p - Generator_previous_p <= Generator_ramp_up_allowance
    description: '`Generator-p-ramp_limit_up` — a generator raises output no faster than its ramp limit
      of the build. A committed one raises it no further than its start-up ramp in the snapshot it turns
      on. A unit that came into the horizon running has a row at the first snapshot only where its `p_init`
      gives the output it brought in. No unit has one at the start of a later investment period, nor does
      any unit a big M releases instead'
  GlobalConstraint_tech_capacity_expansion_limit_eq:
    dims: [global_constraint, scenario]
    where: GlobalConstraint_type == 'tech_capacity_expansion_limit' AND GlobalConstraint_sense == '=='
    expression: tech_capacity_expansion == GlobalConstraint_constant
    description: '`tech_capacity_expansion_limit` — its total, at its constant'
  GlobalConstraint_tech_capacity_expansion_limit_lb:
    dims: [global_constraint, scenario]
    where: GlobalConstraint_type == 'tech_capacity_expansion_limit' AND GlobalConstraint_sense == '>='
    expression: tech_capacity_expansion >= GlobalConstraint_constant
    description: '`tech_capacity_expansion_limit` — its total, at least its constant'
  GlobalConstraint_tech_capacity_expansion_limit_ub:
    dims: [global_constraint, scenario]
    where: GlobalConstraint_type == 'tech_capacity_expansion_limit' AND GlobalConstraint_sense == '<='
    expression: tech_capacity_expansion <= GlobalConstraint_constant
    description: '`tech_capacity_expansion_limit` — its total, at most its constant'
  GlobalConstraint_transmission_expansion_cost_limit_eq:
    dims: [global_constraint, scenario]
    where: GlobalConstraint_type == 'transmission_expansion_cost_limit' AND GlobalConstraint_sense ==
      '=='
    expression: transmission_expansion_cost == GlobalConstraint_constant
    description: '`transmission_expansion_cost_limit` — its total, at its constant'
  GlobalConstraint_transmission_expansion_cost_limit_lb:
    dims: [global_constraint, scenario]
    where: GlobalConstraint_type == 'transmission_expansion_cost_limit' AND GlobalConstraint_sense ==
      '>='
    expression: transmission_expansion_cost >= GlobalConstraint_constant
    description: '`transmission_expansion_cost_limit` — its total, at least its constant'
  GlobalConstraint_transmission_volume_expansion_limit_ub:
    dims: [global_constraint, scenario]
    where: GlobalConstraint_type == 'transmission_volume_expansion_limit' AND GlobalConstraint_sense ==
      '<='
    expression: transmission_volume_expansion <= GlobalConstraint_constant
    description: '`transmission_volume_expansion_limit` — its total, at most its constant'
  Link_ext_p_lower:
    dims: [link, scenario, snapshot]
    where: Link_p_nom_extendable AND not Link_committable AND Link_active
    expression: Link_p >= Link_p_min_pu * Link_p_nom_ext
    description: '`Link-ext-p-lower` — an extendable link carries at least its minimum of the chosen build,
      negative for the other way'
  Link_ext_p_nom_lower:
    dims: [link, scenario]
    where: Link_p_nom_extendable AND Link_active_asset
    expression: Link_p_nom_ext >= Link_p_nom_min
    description: '`Link-ext-p_nom-lower` — the chosen build is at least its floor in every scenario'
  Link_ext_p_nom_upper:
    dims: [link, scenario]
    where: Link_p_nom_extendable AND Link_active_asset AND Link_p_nom_max
    expression: Link_p_nom_ext <= Link_p_nom_max
    description: '`Link-ext-p_nom-upper` — the chosen build is at most its cap in every scenario. A cap
      of infinity is no row'
  Link_ext_p_upper:
    dims: [link, scenario, snapshot]
    where: Link_p_nom_extendable AND not Link_committable AND Link_active
    expression: Link_p <= Link_p_max_pu * Link_p_nom_ext
    description: '`Link-ext-p-upper` — an extendable link carries at most the chosen build'
  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'
  Link_p_nom_set:
    dims: [link]
    where: Link_p_nom_extendable AND Link_active_asset AND Link_p_nom_set
    expression: Link_p_nom_ext == Link_p_nom_set
    description: '`Link-p_nom_set` — the chosen build pinned, wherever a value is given'
  Link_p_ramp_limit_down:
    dims: [link, scenario, snapshot]
    where: (Link_ramp_limit_down OR Link_ramp_limit_shut_down) AND NOT (Link_committable AND Link_p_nom_extendable
      AND NOT (Link_p_nom_mod > 0)) AND Link_ramps_from_previous AND Link_active
    expression: Link_previous_p - Link_p <= Link_ramp_down_allowance
    description: '`Link-p-ramp_limit_down` — a link lowers flow no faster than its ramp limit of the build.
      A committed one lowers it no further than its shut-down ramp in the snapshot it turns off. A link
      that came into the horizon running has a row at the first snapshot only where its `p_init` gives
      the flow it brought in. No link has one at the start of a later investment period, nor does any
      link a big M releases instead'
  Link_p_ramp_limit_up:
    dims: [link, scenario, snapshot]
    where: (Link_ramp_limit_up OR Link_ramp_limit_start_up) AND NOT (Link_committable AND Link_p_nom_extendable
      AND NOT (Link_p_nom_mod > 0)) AND Link_ramps_from_previous AND Link_active
    expression: Link_p - Link_previous_p <= Link_ramp_up_allowance
    description: '`Link-p-ramp_limit_up` — a link raises flow no faster than its ramp limit of the build.
      A committed one raises it no further than its start-up ramp in the snapshot it turns on. A link
      that came into the horizon running has a row at the first snapshot only where its `p_init` gives
      the flow it brought in. No link has one at the start of a later investment period, nor does any
      link a big M releases instead'
  StorageUnit_energy_balance:
    dims: [scenario, snapshot, storage_unit]
    where: StorageUnit_active
    expression: ((StorageUnit_charge_carried_in + ((StorageUnit_efficiency_store * StorageUnit_p_store)
      * snapshot_weightings_stores)) - ((StorageUnit_p_dispatch * snapshot_weightings_stores) / StorageUnit_efficiency_dispatch))
      + (StorageUnit_inflow * snapshot_weightings_stores) == StorageUnit_state_of_charge
    description: '`StorageUnit-energy_balance` — the charge carried in, plus what is stored after its
      efficiency, less what dispatch draws down before its own, plus inflow not spilled'
  StorageUnit_ext_p_dispatch_lower:
    dims: [scenario, snapshot, storage_unit]
    where: StorageUnit_ext
    expression: StorageUnit_p_dispatch >= 0
    description: '`StorageUnit-ext-p_dispatch-lower` — dispatch is non-negative'
  StorageUnit_ext_p_dispatch_upper:
    dims: [scenario, snapshot, storage_unit]
    where: StorageUnit_ext
    expression: StorageUnit_p_dispatch <= StorageUnit_p_max_pu * StorageUnit_p_nom_ext
    description: '`StorageUnit-ext-p_dispatch-upper` — an extendable unit dispatches at most the chosen
      build'
  StorageUnit_ext_p_nom_lower:
    dims: [scenario, storage_unit]
    where: StorageUnit_p_nom_extendable AND StorageUnit_active_asset
    expression: StorageUnit_p_nom_ext >= StorageUnit_p_nom_min
    description: '`StorageUnit-ext-p_nom-lower` — the chosen build is at least its floor in every scenario'
  StorageUnit_ext_p_nom_upper:
    dims: [scenario, storage_unit]
    where: StorageUnit_p_nom_extendable AND StorageUnit_active_asset AND StorageUnit_p_nom_max
    expression: StorageUnit_p_nom_ext <= StorageUnit_p_nom_max
    description: '`StorageUnit-ext-p_nom-upper` — the chosen build is at most its cap in every scenario.
      A cap of infinity is no row'
  StorageUnit_ext_p_store_lower:
    dims: [scenario, snapshot, storage_unit]
    where: StorageUnit_ext
    expression: StorageUnit_p_store >= 0
    description: '`StorageUnit-ext-p_store-lower` — storing is non-negative'
  StorageUnit_ext_p_store_upper:
    dims: [scenario, snapshot, storage_unit]
    where: StorageUnit_ext
    expression: StorageUnit_p_store <= -StorageUnit_p_min_pu * StorageUnit_p_nom_ext
    description: '`StorageUnit-ext-p_store-upper` — an extendable unit stores at most the chosen build,
      the minimum-per-unit column carrying that cap negated'
  StorageUnit_ext_state_of_charge_lower:
    dims: [scenario, snapshot, storage_unit]
    where: StorageUnit_ext
    expression: StorageUnit_state_of_charge >= 0
    description: '`StorageUnit-ext-state_of_charge-lower` — charge is non-negative'
  StorageUnit_ext_state_of_charge_upper:
    dims: [scenario, snapshot, storage_unit]
    where: StorageUnit_ext
    expression: StorageUnit_state_of_charge <= StorageUnit_max_hours * StorageUnit_p_nom_ext
    description: '`StorageUnit-ext-state_of_charge-upper` — an extendable unit holds at most its hours
      at the chosen build'
  StorageUnit_fix_p_dispatch_lower:
    dims: [scenario, snapshot, storage_unit]
    where: StorageUnit_fix
    expression: StorageUnit_p_dispatch >= 0
    description: '`StorageUnit-fix-p_dispatch-lower` — dispatch is non-negative'
  StorageUnit_fix_p_dispatch_upper:
    dims: [scenario, snapshot, storage_unit]
    where: StorageUnit_fix
    expression: StorageUnit_p_dispatch <= StorageUnit_p_max_pu * StorageUnit_p_nom
    description: '`StorageUnit-fix-p_dispatch-upper` — a fixed unit dispatches at most its nominal power'
  StorageUnit_fix_p_store_lower:
    dims: [scenario, snapshot, storage_unit]
    where: StorageUnit_fix
    expression: StorageUnit_p_store >= 0
    description: '`StorageUnit-fix-p_store-lower` — storing is non-negative'
  StorageUnit_fix_p_store_upper:
    dims: [scenario, snapshot, storage_unit]
    where: StorageUnit_fix
    expression: StorageUnit_p_store <= -StorageUnit_p_min_pu * StorageUnit_p_nom
    description: '`StorageUnit-fix-p_store-upper` — a fixed unit stores at most its nominal power, the
      minimum-per-unit column carrying that cap negated'
  StorageUnit_fix_state_of_charge_lower:
    dims: [scenario, snapshot, storage_unit]
    where: StorageUnit_fix
    expression: StorageUnit_state_of_charge >= 0
    description: '`StorageUnit-fix-state_of_charge-lower` — charge is non-negative'
  StorageUnit_fix_state_of_charge_upper:
    dims: [scenario, snapshot, storage_unit]
    where: StorageUnit_fix
    expression: StorageUnit_state_of_charge <= StorageUnit_max_hours * StorageUnit_p_nom
    description: '`StorageUnit-fix-state_of_charge-upper` — a fixed unit holds at most its hours at nominal
      power'
  StorageUnit_p_nom_set:
    dims: [storage_unit]
    where: StorageUnit_p_nom_extendable AND StorageUnit_active_asset AND StorageUnit_p_nom_set
    expression: StorageUnit_p_nom_ext == StorageUnit_p_nom_set
    description: '`StorageUnit-p_nom_set` — the chosen build pinned, wherever a value is given'
  Store_e_nom_set:
    dims: [store]
    where: Store_e_nom_extendable AND Store_active_asset AND Store_e_nom_set
    expression: Store_e_nom_ext == Store_e_nom_set
    description: '`Store-e_nom_set` — the chosen build pinned, wherever a value is given'
  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_ext_e_lower:
    dims: [scenario, snapshot, store]
    where: Store_e_nom_extendable AND Store_active
    expression: Store_e >= Store_e_min_pu * Store_e_nom_ext
    description: '`Store-ext-e-lower` — an extendable store holds at least its floor of the chosen build'
  Store_ext_e_nom_lower:
    dims: [scenario, store]
    where: Store_e_nom_extendable AND Store_active_asset
    expression: Store_e_nom_ext >= Store_e_nom_min
    description: '`Store-ext-e_nom-lower` — the chosen build is at least its floor in every scenario'
  Store_ext_e_nom_upper:
    dims: [scenario, store]
    where: Store_e_nom_extendable AND Store_active_asset AND Store_e_nom_max
    expression: Store_e_nom_ext <= Store_e_nom_max
    description: '`Store-ext-e_nom-upper` — the chosen build is at most its cap in every scenario. A cap
      of infinity is no row'
  Store_ext_e_upper:
    dims: [scenario, snapshot, store]
    where: Store_e_nom_extendable AND Store_active
    expression: Store_e <= Store_e_max_pu * Store_e_nom_ext
    description: '`Store-ext-e-upper` — an extendable store holds at most the chosen build'
  Store_ext_p_store_lower:
    dims: [scenario, snapshot, store]
    where: Store_e_nom_extendable AND Store_active
    expression: Store_p_store >= 0
    description: '`Store-ext-p_store-lower` — charging is non-negative'
  Store_ext_p_store_upper:
    dims: [scenario, snapshot, store]
    where: 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_ext
    description: '`Store-ext-p_store-upper` — an extendable store charges at most the power rating of
      the chosen build 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'
  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) + StorageUnit_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_capex: {expression: sum(scenario_weight * Generator_p_nom_ext * Generator_capital_cost * Generator_capital_weight)}
  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_p_carried_over:
    dims: [generator, scenario, snapshot]
    description: the output a generator carries over into a snapshot. At the first, it is the `p_init`
      it brought in, which is zero where it came in off. After that, it is the previous snapshot's
    cases:
      opening: {when: position(snapshot) == 0, expression: Generator_p_init}
    otherwise: shift(Generator_p, along=snapshot, offset=1)
  Generator_p_nom_committed:
    dims: [generator, scenario]
    description: 'the build a committed unit''s ramp rows are taken against: one module where the build
      is modular, since its status counts modules, and the given build otherwise (`constraints.py:1131-1134`)'
    cases:
      modular_build: {when: Generator_p_nom_mod > 0, expression: Generator_p_nom_mod}
    otherwise: Generator_p_nom
  Generator_p_nom_effective:
    dims: [generator, scenario]
    description: 'the build a generator''s limits are taken against: the chosen one where it is extendable,
      the given one otherwise'
    cases:
      extendable: {when: Generator_p_nom_extendable, expression: Generator_p_nom_ext}
    otherwise: Generator_p_nom
  Generator_previous_p:
    dims: [generator, scenario, snapshot]
    description: 'the output a generator carries into a snapshot. It is nothing at the first snapshot
      it is active in past the first of the horizon: PyPSA fills an output it did not build with zero
      (`constraints.py:716`). It is the output carried over otherwise'
    cases:
      opening_late: {when: 'position(snapshot) > 0 AND NOT shift(Generator_active, along=snapshot, offset=1)',
        expression: '0'}
    otherwise: Generator_p_carried_over
  Generator_previous_status:
    dims: [generator, scenario, snapshot]
    description: the commitment state a generator carries into a snapshot. It is off at the first snapshot
      it is active in past the first of the horizon. PyPSA reads a status it did not build as off there
      (`constraints.py:391`). It is the state carried over otherwise
    cases:
      opening_late: {when: 'position(snapshot) > 0 AND NOT shift(Generator_active, along=snapshot, offset=1)',
        expression: '0'}
    otherwise: Generator_status_carried_over
  Generator_ramp_down_allowance:
    dims: [generator, scenario, snapshot]
    description: how far a generator may lower output between two snapshots. It is its ramp limit of the
      build while it stays on, plus its shut-down ramp in the snapshot it turns off
    cases:
      committed: {when: Generator_committable, expression: Generator_ramp_down_rate * Generator_p_nom_committed
          * Generator_status + Generator_shut_down_rate * Generator_p_nom_committed * (Generator_ramp_previous_status
          - Generator_status)}
    otherwise: Generator_ramp_down_rate * Generator_p_nom_effective
  Generator_ramp_down_rate:
    dims: [generator, scenario, snapshot]
    description: the ramp limit in a unit's down row, PyPSA's `ramp_limit_down`. It is the full build
      where PyPSA has none, since a shut-down ramp alone builds the row
    cases:
      given: {when: Generator_ramp_limit_down, expression: Generator_ramp_limit_down}
    otherwise: '1'
  Generator_ramp_previous_status:
    dims: [generator, scenario, snapshot]
    description: the status a committed unit's ramp rows carry into a snapshot. At the first snapshot,
      a fixed modular unit that came in running has every module on, since the state it brought in is
      on or off (`constraints.py:1152-1157`). The transition and down-time rows count it as one module
      (PyPSA/PyPSA#2114). It is the state carried in otherwise
    cases:
      opening_modules: {when: position(snapshot) == 0 AND NOT Generator_p_nom_extendable AND Generator_p_nom_mod
          > 0, expression: Generator_status_initial * Generator_modules_installed}
    otherwise: Generator_previous_status
  Generator_ramp_up_allowance:
    dims: [generator, scenario, snapshot]
    description: how far a generator may raise output between two snapshots. It is its ramp limit of the
      build while it stays on, plus its start-up ramp in the snapshot it turns on
    cases:
      committed: {when: Generator_committable, expression: Generator_ramp_up_rate * Generator_p_nom_committed
          * Generator_ramp_previous_status + Generator_start_up_rate * Generator_p_nom_committed * (Generator_status
          - Generator_ramp_previous_status)}
    otherwise: Generator_ramp_up_rate * Generator_p_nom_effective
  Generator_ramp_up_rate:
    dims: [generator, scenario, snapshot]
    description: the ramp limit in a unit's up row, PyPSA's `ramp_limit_up`. It is the full build where
      PyPSA has none, since a start-up ramp alone builds the row
    cases:
      given: {when: Generator_ramp_limit_up, expression: Generator_ramp_limit_up}
    otherwise: '1'
  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
  Generator_shut_down_rate:
    dims: [generator, scenario]
    description: the shut-down ramp in a unit's down row (PyPSA's `ramp_limit_shut_down`), or the full
      build where it has none
    cases:
      given: {when: Generator_ramp_limit_shut_down, expression: Generator_ramp_limit_shut_down}
    otherwise: '1'
  Generator_start_up_rate:
    dims: [generator, scenario]
    description: the start-up ramp in a unit's up row (PyPSA's `ramp_limit_start_up`), or the full build
      where it has none
    cases:
      given: {when: Generator_ramp_limit_start_up, expression: Generator_ramp_limit_start_up}
    otherwise: '1'
  Generator_status_carried_over:
    dims: [generator, scenario, snapshot]
    description: 'the state a generator carries over into a snapshot: the state it brought into the horizon
      at the first, the previous snapshot''s after that'
    cases:
      opening: {when: position(snapshot) == 0, expression: Generator_status_initial}
    otherwise: shift(Generator_status, along=snapshot, offset=1)
  Generator_tech_capacity_expansion: {expression: 'sum(Generator_p_nom_ext * Generator_tech_capacity_weight,
      over=generator)'}
  Link_capex: {expression: sum(scenario_weight * Link_p_nom_ext * Link_capital_cost * Link_capital_weight)}
  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
  Link_p_carried_over:
    dims: [link, scenario, snapshot]
    description: the output a link carries over into a snapshot. At the first, it is the `p_init` it brought
      in, which is zero where it came in off. After that, it is the previous snapshot's
    cases:
      opening: {when: position(snapshot) == 0, expression: Link_p_init}
    otherwise: shift(Link_p, along=snapshot, offset=1)
  Link_p_nom_committed:
    dims: [link, scenario]
    description: 'the build a committed link''s ramp rows are taken against: one module where the build
      is modular, since its status counts modules, and the given build otherwise (`constraints.py:1131-1134`)'
    cases:
      modular_build: {when: Link_p_nom_mod > 0, expression: Link_p_nom_mod}
    otherwise: Link_p_nom
  Link_p_nom_effective:
    dims: [link, scenario]
    description: 'the build a link''s limits are taken against: the chosen one where it is extendable,
      the given one otherwise'
    cases:
      extendable: {when: Link_p_nom_extendable, expression: Link_p_nom_ext}
    otherwise: Link_p_nom
  Link_previous_p:
    dims: [link, scenario, snapshot]
    description: 'the output a link carries into a snapshot. It is nothing at the first snapshot it is
      active in past the first of the horizon: PyPSA fills an output it did not build with zero (`constraints.py:716`).
      It is the output carried over otherwise'
    cases:
      opening_late: {when: 'position(snapshot) > 0 AND NOT shift(Link_active, along=snapshot, offset=1)',
        expression: '0'}
    otherwise: Link_p_carried_over
  Link_previous_status:
    dims: [link, scenario, snapshot]
    description: the commitment state a link carries into a snapshot. It is off at the first snapshot
      it is active in past the first of the horizon. PyPSA reads a status it did not build as off there
      (`constraints.py:391`). It is the state carried over otherwise
    cases:
      opening_late: {when: 'position(snapshot) > 0 AND NOT shift(Link_active, along=snapshot, offset=1)',
        expression: '0'}
    otherwise: Link_status_carried_over
  Link_ramp_down_allowance:
    dims: [link, scenario, snapshot]
    description: how far a link may lower flow between two snapshots. It is its ramp limit of the build
      while it stays on, plus its shut-down ramp in the snapshot it turns off
    cases:
      committed: {when: Link_committable, expression: Link_ramp_down_rate * Link_p_nom_committed * Link_status
          + Link_shut_down_rate * Link_p_nom_committed * (Link_ramp_previous_status - Link_status)}
    otherwise: Link_ramp_down_rate * Link_p_nom_effective
  Link_ramp_down_rate:
    dims: [link, scenario, snapshot]
    description: the ramp limit in a link's down row, PyPSA's `ramp_limit_down`. It is the full build
      where PyPSA has none, since a shut-down ramp alone builds the row
    cases:
      given: {when: Link_ramp_limit_down, expression: Link_ramp_limit_down}
    otherwise: '1'
  Link_ramp_previous_status:
    dims: [link, scenario, snapshot]
    description: the status a committed link's ramp rows carry into a snapshot. At the first snapshot,
      a fixed modular link that came in running has every module on, since the state it brought in is
      on or off (`constraints.py:1152-1157`). The transition and down-time rows count it as one module
      (PyPSA/PyPSA#2114). It is the state carried in otherwise
    cases:
      opening_modules: {when: position(snapshot) == 0 AND NOT Link_p_nom_extendable AND Link_p_nom_mod
          > 0, expression: Link_status_initial * Link_modules_installed}
    otherwise: Link_previous_status
  Link_ramp_up_allowance:
    dims: [link, scenario, snapshot]
    description: how far a link may raise flow between two snapshots. It is its ramp limit of the build
      while it stays on, plus its start-up ramp in the snapshot it turns on
    cases:
      committed: {when: Link_committable, expression: Link_ramp_up_rate * Link_p_nom_committed * Link_ramp_previous_status
          + Link_start_up_rate * Link_p_nom_committed * (Link_status - Link_ramp_previous_status)}
    otherwise: Link_ramp_up_rate * Link_p_nom_effective
  Link_ramp_up_rate:
    dims: [link, scenario, snapshot]
    description: the ramp limit in a link's up row, PyPSA's `ramp_limit_up`. It is the full build where
      PyPSA has none, since a start-up ramp alone builds the row
    cases:
      given: {when: Link_ramp_limit_up, expression: Link_ramp_limit_up}
    otherwise: '1'
  Link_shut_down_rate:
    dims: [link, scenario]
    description: the shut-down ramp in a link's down row (PyPSA's `ramp_limit_shut_down`), or the full
      build where it has none
    cases:
      given: {when: Link_ramp_limit_shut_down, expression: Link_ramp_limit_shut_down}
    otherwise: '1'
  Link_start_up_rate:
    dims: [link, scenario]
    description: the start-up ramp in a link's up row (PyPSA's `ramp_limit_start_up`), or the full build
      where it has none
    cases:
      given: {when: Link_ramp_limit_start_up, expression: Link_ramp_limit_start_up}
    otherwise: '1'
  Link_status_carried_over:
    dims: [link, scenario, snapshot]
    description: 'the state a link carries over into a snapshot: the state it brought into the horizon
      at the first, the previous snapshot''s after that'
    cases:
      opening: {when: position(snapshot) == 0, expression: Link_status_initial}
    otherwise: shift(Link_status, along=snapshot, offset=1)
  Link_tech_capacity_expansion: {expression: 'sum(Link_p_nom_ext * Link_tech_capacity_weight, over=link)'}
  Link_transmission_expansion_cost: {expression: 'sum(Link_p_nom_ext * Link_expansion_cost_weight, over=link)'}
  Link_transmission_volume_expansion: {expression: 'sum(Link_p_nom_ext * Link_volume_weight, over=link)'}
  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_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
  StorageUnit_capex: {expression: sum(scenario_weight * StorageUnit_p_nom_ext * StorageUnit_capital_cost
      * StorageUnit_capital_weight)}
  StorageUnit_charge_carried_in:
    dims: [scenario, snapshot, storage_unit]
    description: the charge a unit 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 charge, which no standing loss has touched yet. Otherwise it is the previous snapshot's
      less standing loss. A unit 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: StorageUnit_cyclic_state_of_charge AND NOT StorageUnit_cyclic_state_of_charge_per_period
          AND NOT StorageUnit_state_of_charge_initial_per_period AND (position(snapshot) == 0 OR StorageUnit_opens_late),
        expression: 'StorageUnit_retention * shift(shift(StorageUnit_state_of_charge, along=snapshot,
          offset=1, edge=''wrap''), along=snapshot, offset=StorageUnit_inactive_snapshots, edge=''wrap'')'}
      opening: {when: NOT StorageUnit_cyclic_state_of_charge AND NOT StorageUnit_cyclic_state_of_charge_per_period
          AND NOT StorageUnit_state_of_charge_initial_per_period AND (position(snapshot) == 0 OR StorageUnit_opens_late),
        expression: StorageUnit_state_of_charge_initial}
      period_cyclic: {when: StorageUnit_cyclic_state_of_charge_per_period, expression: 'StorageUnit_retention
          * shift(StorageUnit_state_of_charge, along=snapshot, offset=1, edge=''wrap'', within=snapshot_period[period])'}
      period_opening: {when: 'StorageUnit_state_of_charge_initial_per_period AND NOT StorageUnit_cyclic_state_of_charge_per_period
          AND position(snapshot, within=snapshot_period[period]) == 0', expression: StorageUnit_state_of_charge_initial}
    otherwise: StorageUnit_retention * shift(StorageUnit_state_of_charge, along=snapshot, offset=1)
  StorageUnit_injection: {expression: 'sum(StorageUnit_sign * (StorageUnit_p_dispatch - StorageUnit_p_store),
      over=storage_unit, by=StorageUnit_bus[bus])'}
  StorageUnit_opex: {expression: '(sum(sum(((StorageUnit_p_dispatch * StorageUnit_marginal_cost) * snapshot_weightings_objective)
      * at(period_weight_objective, by=snapshot_period[period]), over=storage_unit), over=snapshot) +
      sum(sum((((StorageUnit_p_dispatch * StorageUnit_p_dispatch) * StorageUnit_marginal_cost_quadratic)
      * snapshot_weightings_objective) * at(period_weight_objective, by=snapshot_period[period]), over=storage_unit),
      over=snapshot)) + sum(sum(((StorageUnit_state_of_charge * StorageUnit_marginal_cost_storage) * snapshot_weightings_objective)
      * at(period_weight_objective, by=snapshot_period[period]), over=storage_unit), over=snapshot)'}
  StorageUnit_tech_capacity_expansion: {expression: 'sum(StorageUnit_p_nom_ext * StorageUnit_tech_capacity_weight,
      over=storage_unit)'}
  Store_capex: {expression: sum(scenario_weight * Store_e_nom_ext * Store_capital_cost * Store_capital_weight)}
  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)'}
  Store_tech_capacity_expansion: {expression: 'sum(Store_e_nom_ext * Store_tech_capacity_weight, over=store)'}
  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) + StorageUnit_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`)'
  tech_capacity_expansion:
    dims: [global_constraint]
    expression: ((Generator_tech_capacity_expansion + Link_tech_capacity_expansion) + StorageUnit_tech_capacity_expansion)
      + Store_tech_capacity_expansion
    description: 'what a `tech_capacity_expansion_limit` row totals: the chosen build of the row''s carrier-and-bus
      set'
  total_cost:
    dims: []
    expression: (((Generator_capex + Link_capex) + StorageUnit_capex) + Store_capex) + 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
  transmission_expansion_cost:
    dims: [global_constraint, scenario]
    expression: Link_transmission_expansion_cost
    description: 'what a `transmission_expansion_cost_limit` row totals: capital cost times the chosen
      build of the row''s branches'
  transmission_volume_expansion:
    dims: [global_constraint, scenario]
    expression: Link_transmission_volume_expansion
    description: 'what a `transmission_volume_expansion_limit` row totals: length times the chosen build
      of the row''s branches'
conditions:
  Generator_committed: {condition: Generator_committable AND Generator_active, description: 'a committable
      generator that is active in the snapshot''s period: every unit-commitment row''s set'}
  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`)'}
  Generator_ramps_from_previous: {condition: 'position(snapshot, within=snapshot_period[period]) > 0 OR
      (position(snapshot) == 0 AND (Generator_status_initial == 0 OR Generator_p_init))', description: 'a
      snapshot whose ramp uses a previous output. It is any snapshot but its period''s first, and the
      horizon''s first where the generator comes in off or carries an initial output'}
  Link_committed: {condition: Link_committable AND Link_active, description: 'a committable link that
      is active in the snapshot''s period: every unit-commitment row''s set'}
  Link_ramps_from_previous: {condition: 'position(snapshot, within=snapshot_period[period]) > 0 OR (position(snapshot)
      == 0 AND (Link_status_initial == 0 OR Link_p_init))', description: 'a snapshot whose ramp uses a
      previous output. It is any snapshot but its period''s first, and the horizon''s first where the
      link comes in off or carries an initial output'}
  StorageUnit_ext: {condition: StorageUnit_p_nom_extendable AND StorageUnit_active, description: a storage
      unit with an extendable build that is active in the snapshot's period. It is PyPSA's `ext` rows}
  StorageUnit_fix: {condition: NOT StorageUnit_p_nom_extendable AND StorageUnit_active, description: a
      storage unit with a fixed build that is active in the snapshot's period. It is PyPSA's `fix` rows}
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'),
    'StorageUnit_bus': relation(n, 'StorageUnit', '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_03_expansion.yaml', sources) as solution:
    solution.objective  # 7633.908502024291

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

"""Rung 3: expansion — extendable capacity, energy-sum bounds, fixed and set nominal capacities."""

from __future__ import annotations

import spine


def build():
    """The spine plus this rung's additions, as a ``pypsa.Network``."""
    n = spine.build()
    n.add('Bus', 'island')
    n.add('Carrier', 'onwind')
    n.add('Carrier', 'solarpv')
    n.add('Carrier', 'dc')
    n.add('Carrier', 'phs')
    n.add('Carrier', 'h2')
    n.add(
        'Generator',
        'wind',
        bus='north',
        carrier='onwind',
        p_nom_extendable=True,
        capital_cost=50,
        p_nom_min=5,
        p_nom_max=80,
        marginal_cost=0,
        e_sum_min=40,
        ramp_limit_up=0.4,
        ramp_limit_down=0.4,
        p_max_pu=[0.3, 0.8, 0.5, 0.9],
    )
    n.add(
        'Generator',
        'solar',
        bus='north',
        carrier='solarpv',
        p_nom_extendable=True,
        capital_cost=60,
        p_nom_max=40,
        marginal_cost=0,
        p_nom_set=15,
        p_max_pu=[0.5, 0.6, 0.4, 0.2],
    )
    n.add('Generator', 'diesel', bus='island', marginal_cost=40, p_nom=60, e_sum_max=70)
    n.add(
        'Link',
        'cable',
        bus0='north',
        bus1='island',
        carrier='dc',
        length=120,
        p_nom_extendable=True,
        capital_cost=20,
        p_nom_max=30,
        efficiency=0.95,
        p_nom_set=25,
        ramp_limit_up=0.3,
        ramp_limit_down=0.3,
    )
    n.add('Load', 'island_load', bus='island', p_set=10)
    n.add(
        'StorageUnit',
        'pump',
        bus='north',
        carrier='phs',
        p_nom_extendable=True,
        capital_cost=15,
        p_nom_max=30,
        max_hours=4,
        efficiency_store=0.9,
        efficiency_dispatch=0.9,
        cyclic_state_of_charge=True,
        p_nom_set=20,
    )
    n.add('StorageUnit', 'ice', bus='island', max_hours=2, p_nom=8, state_of_charge_initial=6)
    n.add(
        'Store',
        'tank',
        bus='north',
        carrier='h2',
        e_nom_extendable=True,
        capital_cost=2,
        e_nom_max=80,
        e_cyclic=True,
        e_nom_set=50,
    )
    n.add('Store', 'keg', bus='island', e_nom=15, e_initial=5)
    n.add(
        'GlobalConstraint',
        'tech_wind',
        type='tech_capacity_expansion_limit',
        carrier_attribute='onwind',
        sense='==',
        constant=50,
    )
    n.add(
        'GlobalConstraint',
        'tech_solar',
        type='tech_capacity_expansion_limit',
        carrier_attribute='solarpv',
        sense='>=',
        constant=10,
    )
    n.add(
        'GlobalConstraint',
        'tech_dc',
        type='tech_capacity_expansion_limit',
        carrier_attribute='dc',
        sense='<=',
        constant=28,
    )
    n.add(
        'GlobalConstraint',
        'tech_phs',
        type='tech_capacity_expansion_limit',
        carrier_attribute='phs',
        sense='<=',
        constant=25,
    )
    n.add(
        'GlobalConstraint',
        'tech_h2',
        type='tech_capacity_expansion_limit',
        carrier_attribute='h2',
        sense='>=',
        constant=30,
    )
    n.add(
        'GlobalConstraint',
        'vol_dc',
        type='transmission_volume_expansion_limit',
        carrier_attribute='dc',
        sense='<=',
        constant=3500,
    )
    n.add(
        'GlobalConstraint',
        'cost_dc',
        type='transmission_expansion_cost_limit',
        carrier_attribute='dc',
        sense='>=',
        constant=400,
    )
    n.add(
        'GlobalConstraint',
        'cost_dc_exact',
        type='transmission_expansion_cost_limit',
        carrier_attribute='dc',
        sense='==',
        constant=500,
    )
    return n
n = build()
n.optimize(solver_name='highs')
n.objective  # 7633.908502024291

The data

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

Generator_capital_cost.csv

generator,scenario,value
coal,base,0.0
diesel,base,0.0
gas,base,0.0
solar,base,60.0
wind,base,50.0

Generator_capital_weight.csv

generator,value
coal,1.0
diesel,1.0
gas,1.0
solar,1.0
wind,1.0

Generator_e_sum_max.csv

generator,scenario,value
coal,base,inf
diesel,base,70.0
gas,base,inf
solar,base,inf
wind,base,inf

Generator_e_sum_min.csv

generator,scenario,value
coal,base,-inf
diesel,base,-inf
gas,base,-inf
solar,base,-inf
wind,base,40.0

Generator_modules_installed.csv

generator,scenario,value
coal,base,1.0
diesel,base,1.0
gas,base,1.0
solar,base,1.0
wind,base,1.0

Generator_p_nom_max.csv

generator,scenario,value
coal,base,inf
diesel,base,inf
gas,base,inf
solar,base,40.0
wind,base,80.0

Generator_p_nom_min.csv

generator,scenario,value
coal,base,0.0
diesel,base,0.0
gas,base,0.0
solar,base,0.0
wind,base,5.0

Generator_p_nom_set.csv

generator,value
solar,15.0

Generator_ramp_limit_down.csv

generator,scenario,snapshot,value
wind,base,2015-01-01T00:00:00.000000,0.4
wind,base,2015-01-01T01:00:00.000000,0.4
wind,base,2015-01-01T02:00:00.000000,0.4
wind,base,2015-01-01T03:00:00.000000,0.4

Generator_ramp_limit_up.csv

generator,scenario,snapshot,value
wind,base,2015-01-01T00:00:00.000000,0.4
wind,base,2015-01-01T01:00:00.000000,0.4
wind,base,2015-01-01T02:00:00.000000,0.4
wind,base,2015-01-01T03:00:00.000000,0.4

Generator_status_initial.csv

generator,scenario,value
coal,base,1.0
diesel,base,1.0
gas,base,1.0
solar,base,1.0
wind,base,1.0

Generator_tech_capacity_weight.csv

generator,global_constraint,value
solar,tech_solar,1.0
wind,tech_wind,1.0

GlobalConstraint_constant.csv

global_constraint,scenario,value
cost_dc,base,400.0
cost_dc_exact,base,500.0
tech_dc,base,28.0
tech_h2,base,30.0
tech_phs,base,25.0
tech_solar,base,10.0
tech_wind,base,50.0
vol_dc,base,3500.0

GlobalConstraint_sense.csv

global_constraint,scenario,value
cost_dc,base,>=
cost_dc_exact,base,==
tech_dc,base,<=
tech_h2,base,>=
tech_phs,base,<=
tech_solar,base,>=
tech_wind,base,==
vol_dc,base,<=

GlobalConstraint_type.csv

global_constraint,value
cost_dc,transmission_expansion_cost_limit
cost_dc_exact,transmission_expansion_cost_limit
tech_dc,tech_capacity_expansion_limit
tech_h2,tech_capacity_expansion_limit
tech_phs,tech_capacity_expansion_limit
tech_solar,tech_capacity_expansion_limit
tech_wind,tech_capacity_expansion_limit
vol_dc,transmission_volume_expansion_limit

Link_active_asset.csv

link,value
cable,true
wire,true

Link_capital_cost.csv

link,scenario,value
cable,base,20.0
wire,base,0.0

Link_capital_weight.csv

link,value
cable,1.0
wire,1.0

Link_expansion_cost_weight.csv

global_constraint,link,scenario,value
cost_dc,cable,base,20.0
cost_dc_exact,cable,base,20.0

Link_modules_installed.csv

link,scenario,value
cable,base,1.0
wire,base,1.0

Link_p_nom_max.csv

link,scenario,value
cable,base,30.0
wire,base,inf

Link_p_nom_min.csv

link,scenario,value
cable,base,0.0
wire,base,0.0

Link_p_nom_set.csv

link,value
cable,25.0

Link_ramp_limit_down.csv

link,scenario,snapshot,value
cable,base,2015-01-01T00:00:00.000000,0.3
cable,base,2015-01-01T01:00:00.000000,0.3
cable,base,2015-01-01T02:00:00.000000,0.3
cable,base,2015-01-01T03:00:00.000000,0.3

Link_ramp_limit_up.csv

link,scenario,snapshot,value
cable,base,2015-01-01T00:00:00.000000,0.3
cable,base,2015-01-01T01:00:00.000000,0.3
cable,base,2015-01-01T02:00:00.000000,0.3
cable,base,2015-01-01T03:00:00.000000,0.3

Link_status_initial.csv

link,scenario,value
cable,base,1.0
wire,base,1.0

Link_tech_capacity_weight.csv

global_constraint,link,value
tech_dc,cable,1.0

Link_volume_weight.csv

global_constraint,link,scenario,value
vol_dc,cable,base,120.0

StorageUnit_active_asset.csv

storage_unit,value
ice,true
pump,true

StorageUnit_capital_cost.csv

scenario,storage_unit,value
base,ice,0.0
base,pump,15.0

StorageUnit_capital_weight.csv

storage_unit,value
ice,1.0
pump,1.0

StorageUnit_p_nom_max.csv

scenario,storage_unit,value
base,ice,inf
base,pump,30.0

StorageUnit_p_nom_min.csv

scenario,storage_unit,value
base,ice,0.0
base,pump,0.0

StorageUnit_p_nom_set.csv

storage_unit,value
pump,20.0

StorageUnit_tech_capacity_weight.csv

global_constraint,storage_unit,value
tech_phs,pump,1.0

Store_active_asset.csv

store,value
keg,true
tank,true

Store_capital_cost.csv

scenario,store,value
base,keg,0.0
base,tank,2.0

Store_capital_weight.csv

store,value
keg,1.0
tank,1.0

Store_e_nom_max.csv

scenario,store,value
base,keg,inf
base,tank,80.0

Store_e_nom_min.csv

scenario,store,value
base,keg,0.0
base,tank,0.0

Store_e_nom_set.csv

store,value
tank,50.0

Store_tech_capacity_weight.csv

global_constraint,store,value
tech_h2,tank,1.0

global_constraint.csv

global_constraint
cost_dc
cost_dc_exact
tech_dc
tech_h2
tech_phs
tech_solar
tech_wind
vol_dc

period_weight_years.csv

period,value
0,1.0

snapshot_weightings_generators.csv

snapshot,value
2015-01-01T00:00:00.000000,1.5
2015-01-01T01:00:00.000000,0.5
2015-01-01T02:00:00.000000,3.0
2015-01-01T03:00:00.000000,2.0