Skip to content

Rung 33: maintenance — a fixed and an extendable generator, link and process, each taken off for events that the generator weightings time

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 7367.560185 on both sides; structure ✔ 40 constraints · 15 variables, name for name; size ✔ 179 rows · ✔ 103 columns · ✔ 398 nonzeros; duals — integer model, no duals; model for model: 55 blocks equal, 0 documented splits, 1 recorded deviations.

Rows and columns, PyPSA against specsolve, name for name
row PyPSA specsolve
Bus-nodal_balance 12 12
Generator-ext-p-lower 4 4
Generator-ext-p-upper 4 4
Generator-ext-p_nom-lower 1 1
Generator-ext-p_nom-upper 1 1
Generator-fix-p-lower 16 16
Generator-fix-p-upper 16 16
Generator-maint-event-count 2 2
Generator-maint-start-horizon 1 1
Generator-maint-window 8 8
Generator-maintcap_lower_nommax 4 4
Generator-maintcap_lower_nommin 4 4
Generator-maintcap_upper 4 4
Generator-maintcap_upper_nommax 4 4
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 8 8
Link-fix-p-upper 8 8
Link-maint-event-count 2 2
Link-maint-start-horizon 1 1
Link-maint-window 8 8
Link-maintcap_lower_nommax 4 4
Link-maintcap_lower_nommin 4 4
Link-maintcap_upper 4 4
Link-maintcap_upper_nommax 4 4
Process-ext-p-lower 4 4
Process-ext-p-upper 4 4
Process-ext-p_nom-lower 1 1
Process-ext-p_nom-upper 1 1
Process-fix-p-lower 4 4
Process-fix-p-upper 4 4
Process-maint-event-count 2 2
Process-maint-start-horizon 1 1
Process-maint-window 8 8
Process-maintcap_lower_nommax 4 4
Process-maintcap_lower_nommin 4 4
Process-maintcap_upper 4 4
Process-maintcap_upper_nommax 4 4
column PyPSA specsolve
Generator-maintenance 8 8
Generator-maintenance_capacity 4 4
Generator-maintenance_start 8 8
Generator-p 20 20
Generator-p_nom 1 1
Link-maintenance 8 8
Link-maintenance_capacity 4 4
Link-maintenance_start 8 8
Link-p 12 12
Link-p_nom 1 1
Process-maintenance 8 8
Process-maintenance_capacity 4 4
Process-maintenance_start 8 8
Process-p 8 8
Process-p_nom 1 1

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}\) — network nodes
\(\mathcal{G}\) index \(g\) — generator with \(\mathrm{Generator\_bus}: \mathcal{G} \to \mathcal{N},\ \mathrm{Generator\_maintenance\_cover} \subseteq \mathcal{T} \times \mathcal{G} \times \Xi \times \mathcal{T}\), Generator_maintenance_cover is absent where the data has no row — generating units, each on one bus
\(\mathcal{L}\) index \(l\) — link with \(\mathrm{Link\_bus0}: \mathcal{L} \to \mathcal{N},\ \mathrm{Link\_maintenance\_cover} \subseteq \mathcal{T} \times \mathcal{L} \times \Xi \times \mathcal{T},\ \mathrm{Link\_output\_link}: \mathcal{O} \to \mathcal{L}\), Link_maintenance_cover is absent where the data has no row — 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\_maintenance\_cover} \subseteq \mathcal{T} \times \mathcal{J} \times \Xi \times \mathcal{T},\ \mathrm{Process\_output\_process}: \mathcal{R} \to \mathcal{J}\), Process_maintenance_cover is absent where the data has no row — 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 with \(\mathrm{Generator\_maintenance\_cover} \subseteq \mathcal{T} \times \mathcal{G} \times \Xi \times \mathcal{T},\ \mathrm{Link\_maintenance\_cover} \subseteq \mathcal{T} \times \mathcal{L} \times \Xi \times \mathcal{T},\ \mathrm{Process\_maintenance\_cover} \subseteq \mathcal{T} \times \mathcal{J} \times \Xi \times \mathcal{T}\), Generator_maintenance_cover is absent where the data has no row, Link_maintenance_cover is absent where the data has no row, Process_maintenance_cover is absent where the data has no row — the futures dispatch is chosen in, each with a weight
\(\mathcal{T}\) index \(t\) — snapshot with \(\mathrm{Generator\_maintenance\_cover} \subseteq \mathcal{T} \times \mathcal{G} \times \Xi \times \mathcal{T},\ \mathrm{Link\_maintenance\_cover} \subseteq \mathcal{T} \times \mathcal{L} \times \Xi \times \mathcal{T},\ \mathrm{Process\_maintenance\_cover} \subseteq \mathcal{T} \times \mathcal{J} \times \Xi \times \mathcal{T},\ \mathrm{snapshot\_period}: \mathcal{T} \to \mathcal{Y}\), Generator_maintenance_cover is absent where the data has no row, Link_maintenance_cover is absent where the data has no row, Process_maintenance_cover is absent where the data has no row — dispatch periods

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
\(\mathrm{mnt}\) Generator_maintainable over \(\mathcal{G}\) — whether a generator must be taken off for maintenance within the horizon: in any scenario, as PyPSA takes the union over them (components.py:1000-1003)
\(\mathrm{n}^{\mathrm{mnt}}\) Generator_maintenance_events over \(\mathcal{G} \times \Xi\) — how many maintenance events occur within the horizon
\(\gamma\) Generator_maintenance_pu over \(\mathcal{G} \times \Xi\) — the share of the build a maintenance event takes off
\(\mathrm{blk}\) Generator_maintenance_start_blocked over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — true where no maintenance event may start, data prep. The snapshots it would cover there run past the end of the horizon or into one the generator is not active in. It is PyPSA's active & ~valid, from maintenance_duration and the generator weightings
\(\mathrm{c}\) Generator_marginal_cost over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — cost of one unit of output
\(\mathrm{p}^{\mathrm{curve}}\) Generator_marginal_cost_curve_p over \(\mathcal{B} \times \mathcal{G}\), absent where the data has no row — the output at each breakpoint of a generator's piecewise marginal_cost curve: PyPSA's p_pu breakpoints times p_nom, data prep. A generator with no curve has no rows
\(\mathrm{c}^{(2)}\) Generator_marginal_cost_quadratic over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — cost of the square of one unit of output
\(\overline{\mathrm{p}}\) Generator_p_max_pu over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — most output, per unit of nominal power: an availability profile
\(\underline{\mathrm{p}}\) Generator_p_min_pu over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — least output, per unit of nominal power
\(\mathrm{p}^{\mathrm{nom}}\) Generator_p_nom over \(\mathcal{G} \times \Xi\) — nominal power
\(\mathrm{ext}\) Generator_p_nom_extendable over \(\mathcal{G}\) — whether the nominal power is a decision
\(\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{sgn}\) Generator_sign over \(\mathcal{G}\) — the sign output enters its bus's balance with. It is PyPSA's sign, 1 unless given, -1 for a unit that draws power. PyPSA refuses one that differs by scenario (constants.py:46)
\(\mathrm{on}^{f}\) Link_active over \(\mathcal{L} \times \mathcal{T}\) — whether a link is active in a snapshot's period. It is PyPSA's active, data prep
\(\mathrm{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{mnt}^{f}\) Link_maintainable over \(\mathcal{L}\) — whether a link must be taken off for maintenance within the horizon: in any scenario, as PyPSA takes the union over them (components.py:1000-1003)
\(\mathrm{n}^{f,\mathrm{mnt}}\) Link_maintenance_events over \(\mathcal{L} \times \Xi\) — how many maintenance events occur within the horizon
\(\gamma^{f}\) Link_maintenance_pu over \(\mathcal{L} \times \Xi\) — the share of the build a maintenance event takes off
\(\mathrm{blk}^{f}\) Link_maintenance_start_blocked over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — true where no maintenance event may start, data prep. The snapshots it would cover there run past the end of the horizon or into one the link is not active in. It is PyPSA's active & ~valid, from maintenance_duration and the generator weightings
\(\mathrm{c}^{f}\) Link_marginal_cost over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — cost of one unit of flow
\(\mathrm{c}^{f,(2)}\) Link_marginal_cost_quadratic over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — cost of the square of one unit of flow
\(\mathrm{cyc}^{f}\) Link_output_cyclic_delay over \(\mathcal{O}\) — whether a delayed port's flow wraps from the end of its investment period (PyPSA's cyclic_delay, cyclic_delay2, …). Where it does not, the flow still in transit at each period's first snapshots is lost. The flag is the same in every scenario, as the delay is
\(\mathrm{d}^{f}\) Link_output_delay over \(\mathcal{O}\) — snapshots a port's delivery lags its link's flow (PyPSA's delay, delay2, … read long). In data prep you divide it by the snapshot_weightings.generators value and round it up. It is zero for a port that delivers at once. A port has the same delay in every scenario, because PyPSA refuses a delay that differs by scenario (constants.py:55)
\(\overline{\mathrm{f}}\) Link_p_max_pu over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — most flow, per unit of nominal power
\(\underline{\mathrm{f}}\) Link_p_min_pu over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — least flow, per unit of nominal power: negative for a link that carries both ways
\(\mathrm{f}^{\mathrm{nom}}\) Link_p_nom over \(\mathcal{L} \times \Xi\) — nominal power
\(\mathrm{ext}^{f}\) Link_p_nom_extendable over \(\mathcal{L}\) — whether the nominal power is a decision
\(\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{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{act}^{z}\) Process_active_asset over \(\mathcal{J}\) — whether a process 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},z}\) Process_capital_cost over \(\mathcal{J} \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}^{z}\) Process_capital_weight over \(\mathcal{J}\) — the sum of period weights a process is active in. It is PyPSA's active * period_weighting, summed, data prep
\(\mathrm{com}^{z}\) Process_committable over \(\mathcal{J}\) — whether internal power is gated by an on/off status decision
\(\mathrm{mnt}^{z}\) Process_maintainable over \(\mathcal{J}\) — whether a process must be taken off for maintenance within the horizon: in any scenario, as PyPSA takes the union over them (components.py:1000-1003)
\(\mathrm{n}^{z,\mathrm{mnt}}\) Process_maintenance_events over \(\mathcal{J} \times \Xi\) — how many maintenance events occur within the horizon
\(\gamma^{z}\) Process_maintenance_pu over \(\mathcal{J} \times \Xi\) — the share of the build a maintenance event takes off
\(\mathrm{blk}^{z}\) Process_maintenance_start_blocked over \(\mathcal{J} \times \Xi \times \mathcal{T}\) — true where no maintenance event may start, data prep. The snapshots it would cover there run past the end of the horizon or into one the process is not active in. It is PyPSA's active & ~valid, from maintenance_duration and the generator weightings
\(\mathrm{c}^{z}\) Process_marginal_cost over \(\mathcal{J} \times \Xi \times \mathcal{T}\) — cost of one unit of internal power
\(\mathrm{c}^{z,(2)}\) Process_marginal_cost_quadratic over \(\mathcal{J} \times \Xi \times \mathcal{T}\) — cost of the square of one unit of internal power
\(\mathrm{cyc}^{z}\) Process_output_cyclic_delay over \(\mathcal{R}\) — whether a delayed port's transfer wraps from the end of its investment period (PyPSA's cyclic_delay0, cyclic_delay1, …). Where it does not, the energy still in transit at each period's first snapshots is lost. The flag is the same in every scenario, as the delay is
\(\mathrm{d}^{z}\) Process_output_delay over \(\mathcal{R}\) — snapshots a port's transfer lags its process's internal power (PyPSA's delay0, delay1, … read long). In data prep you divide it by the snapshot_weightings.generators value and round it up. It is zero for a port that transfers at once. A port has the same delay in every scenario, as a link's port has
\(\overline{\mathrm{z}}\) Process_p_max_pu over \(\mathcal{J} \times \Xi \times \mathcal{T}\) — most internal power, per unit of nominal power
\(\underline{\mathrm{z}}\) Process_p_min_pu over \(\mathcal{J} \times \Xi \times \mathcal{T}\) — least internal power, per unit of nominal power: negative for a process that runs both ways
\(\mathrm{z}^{\mathrm{nom}}\) Process_p_nom over \(\mathcal{J} \times \Xi\) — nominal internal power
\(\mathrm{ext}^{z}\) Process_p_nom_extendable over \(\mathcal{J}\) — whether the nominal internal power is a decision
\(\overline{\mathrm{z}}^{\mathrm{nom}}\) Process_p_nom_max over \(\mathcal{J} \times \Xi\) — most nominal power an extendable process may be built at
\(\underline{\mathrm{z}}^{\mathrm{nom}}\) Process_p_nom_min over \(\mathcal{J} \times \Xi\) — least nominal power an extendable process may be built at
\(\mathrm{z}^{\mathrm{mod}}\) Process_p_nom_mod over \(\mathcal{J}\), absent where the data has no row — the module size a build comes in whole numbers of. No value means the build is continuous
\(\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{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)
\(\pi\) scenario_weight over \(\Xi\) — PyPSA's scenario_weightings.weight — the probability of a future
\(\mathrm{w}\) snapshot_weightings_objective over \(\mathcal{T}\) — PyPSA's snapshot_weightings.objective — hours a snapshot weighs in the cost

Conditions

Symbol Meaning
\(\mathrm{Generator\_maint\_ext}\) Generator_maint_ext over \(\mathcal{G} \times \mathcal{T}\) — a maintainable generator with an extendable build that is active in the snapshot's period, unless it is committable and modular. These are the maintenance rows against the chosen build
\(\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{Link\_maint\_ext}\) Link_maint_ext over \(\mathcal{L} \times \mathcal{T}\) — a maintainable link with an extendable build that is active in the snapshot's period, unless it is committable and modular. These are the maintenance rows against the chosen build
\(\mathrm{Process\_maint\_ext}\) Process_maint_ext over \(\mathcal{J} \times \mathcal{T}\) — a maintainable process with an extendable build that is active in the snapshot's period, unless it is committable and modular. These are the maintenance rows against the chosen build

Variables

Symbol Meaning
\(\mu\) Generator_maintenance over \(\mathcal{G} \times \Xi \times \mathcal{T}\), \(0\) where the mask leaves it out — Generator-maintenance — whether a maintainable generator is in maintenance: continuous, and one exactly where an event covers the snapshot
\(\mu^{\mathrm{nom}}\) Generator_maintenance_capacity over \(\mathcal{G} \times \Xi \times \mathcal{T}\), \(0\) where the mask leaves it out — Generator-maintenance_capacity — the chosen build while in maintenance, zero otherwise: the product the maintcap rows linearise
\(\mu^{\mathrm{up}}\) Generator_maintenance_start over \(\mathcal{G} \times \Xi \times \mathcal{T}\), \(0\) where the mask leaves it out — Generator-maintenance_start — whether a maintenance event starts in this snapshot
\(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
\(\mu^{f}\) Link_maintenance over \(\mathcal{L} \times \Xi \times \mathcal{T}\), \(0\) where the mask leaves it out — Link-maintenance — whether a maintainable link is in maintenance: continuous, and one exactly where an event covers the snapshot
\(\mu^{f,\mathrm{nom}}\) Link_maintenance_capacity over \(\mathcal{L} \times \Xi \times \mathcal{T}\), \(0\) where the mask leaves it out — Link-maintenance_capacity — the chosen build while in maintenance, zero otherwise: the product the maintcap rows linearise
\(\mu^{f,\mathrm{up}}\) Link_maintenance_start over \(\mathcal{L} \times \Xi \times \mathcal{T}\), \(0\) where the mask leaves it out — Link-maintenance_start — whether a maintenance event starts in this snapshot
\(f\) Link_p over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — Link-p — PyPSA's p0, the flow measured at the Link_bus0 end. A positive value withdraws there and injects at every bus the link's output ports deliver to
\(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
\(\mu^{z}\) Process_maintenance over \(\mathcal{J} \times \Xi \times \mathcal{T}\), \(0\) where the mask leaves it out — Process-maintenance — whether a maintainable process is in maintenance: continuous, and one exactly where an event covers the snapshot
\(\mu^{z,\mathrm{nom}}\) Process_maintenance_capacity over \(\mathcal{J} \times \Xi \times \mathcal{T}\), \(0\) where the mask leaves it out — Process-maintenance_capacity — the chosen build while in maintenance, zero otherwise: the product the maintcap rows linearise
\(\mu^{z,\mathrm{up}}\) Process_maintenance_start over \(\mathcal{J} \times \Xi \times \mathcal{T}\), \(0\) where the mask leaves it out — Process-maintenance_start — whether a maintenance event starts in this snapshot
\(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
\(Z\) Process_p_nom_ext over \(\mathcal{J}\) — Process-p_nom — nominal internal power where it is a decision, for a process that is active. A fixed build is the parameter of the same PyPSA name

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\_running\_cost}\) Generator_running_cost over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — what a generator's output costs in a snapshot: the value read off its piecewise curve where it has one, and its linear marginal_cost otherwise. A curve replaces the linear cost, as PyPSA drops the unit from that term (optimize.py:333-348)
\(\mathit{Link\_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
\(\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\_capex}\) Process_capex (scalar)
\(\mathit{Process\_injection}\) Process_injection over \(\mathcal{N} \times \Xi \times \mathcal{T}\)
\(\mathit{Process\_opex}\) Process_opex over \(\Xi\)
\(\mathit{Process\_output\_arrival}\) Process_output_arrival over \(\mathcal{R} \times \Xi \times \mathcal{T}\) — what a process transfers at a port at a snapshot. It is its internal power delayed by the port's delay within its investment period. It is multiplied by the port's rate at the snapshot the transfer arrives. Where the port is cyclic_delay, the delayed transfer wraps from the period's end. Where it is not, the energy still in transit at the period's first snapshots is lost. A port that does not delay (delay zero) transfers at once, cyclic or not
\(\mathit{risk\_weighted\_opex}\) risk_weighted_opex (scalar)
\(\mathit{scenario\_opex}\) scenario_opex over \(\Xi\) — what a future costs to run: every operating term, weighted by the snapshot's hours and its period, before the scenario's own weight. A start and a stop cost what they cost, unweighted, as PyPSA adds them (optimize.py:448-468)
\(\mathit{total\_cost}\) total_cost (scalar) — what the system costs. Capacity counts once per active period at its expected cost over the scenarios. Operation counts in expectation over the scenarios, and a share of it at the tail

Notation

Symbol Meaning
\(t \ominus k\) edge='wrap' — \(t-k\), cyclic
\(t \boxminus_{v} k\) edge=v — \(t-k\), and \(v\) past the edge
\(t \ominus^{\mathrm{relation}(t)} k\) within=relation[...] — \(t-k\) inside the group of \(t\)

Conditions

Generator_maint_ext

\[ \mathrm{Generator\_maint\_ext}_{g,t} \iff \mathrm{mnt}_{g} \wedge \mathrm{ext}_{g} \wedge \neg \left( \mathrm{com}_{g} \wedge \mathrm{p}^{\mathrm{mod}}_{g} > 0 \right) \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} \]

Link_maint_ext

\[ \mathrm{Link\_maint\_ext}_{l,t} \iff \mathrm{mnt}^{f}_{l} \wedge \mathrm{ext}^{f}_{l} \wedge \neg \left( \mathrm{com}^{f}_{l} \wedge \mathrm{f}^{\mathrm{mod}}_{l} > 0 \right) \wedge \mathrm{on}^{f}_{l,t} \qquad \forall\, l \in \mathcal{L},\ t \in \mathcal{T} \]

Process_maint_ext

\[ \mathrm{Process\_maint\_ext}_{j,t} \iff \mathrm{mnt}^{z}_{j} \wedge \mathrm{ext}^{z}_{j} \wedge \neg \left( \mathrm{com}^{z}_{j} \wedge \mathrm{z}^{\mathrm{mod}}_{j} > 0 \right) \wedge \mathrm{on}^{z}_{j,t} \qquad \forall\, j \in \mathcal{J},\ t \in \mathcal{T} \]

Variable domains

Generator_maintenance

\[ 0 \le \mu_{g,\xi,t} \le 1 \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{mnt}_{g} \wedge \mathrm{on}_{g,t} \]

Generator_maintenance_capacity

\[ \mu^{\mathrm{nom}}_{g,\xi,t} \ge 0 \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Generator\_maint\_ext}_{g,t} \]

Generator_maintenance_start

\[ \mu^{\mathrm{up}}_{g,\xi,t} \in \{0, 1\} \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{mnt}_{g} \wedge \mathrm{on}_{g,t} \]

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

Link_maintenance

\[ 0 \le \mu^{f}_{l,\xi,t} \le 1 \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{mnt}^{f}_{l} \wedge \mathrm{on}^{f}_{l,t} \]

Link_maintenance_capacity

\[ \mu^{f,\mathrm{nom}}_{l,\xi,t} \ge 0 \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Link\_maint\_ext}_{l,t} \]

Link_maintenance_start

\[ \mu^{f,\mathrm{up}}_{l,\xi,t} \in \{0, 1\} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{mnt}^{f}_{l} \wedge \mathrm{on}^{f}_{l,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} \]

Process_maintenance

\[ 0 \le \mu^{z}_{j,\xi,t} \le 1 \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{mnt}^{z}_{j} \wedge \mathrm{on}^{z}_{j,t} \]

Process_maintenance_capacity

\[ \mu^{z,\mathrm{nom}}_{j,\xi,t} \ge 0 \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Process\_maint\_ext}_{j,t} \]

Process_maintenance_start

\[ \mu^{z,\mathrm{up}}_{j,\xi,t} \in \{0, 1\} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{mnt}^{z}_{j} \wedge \mathrm{on}^{z}_{j,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} \]

Process_p_nom_ext

\[ Z_{j} \in \mathbb{R} \qquad \forall\, j \in \mathcal{J} \,:\, \mathrm{ext}^{z}_{j} \wedge \mathrm{act}^{z}_{j} \]

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

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

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

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_capex

\[ \mathit{Process\_capex} = \sum_{j \in \mathcal{J},\ \xi \in \Xi} \pi_{\xi} \cdot Z_{j} \cdot \mathrm{c}^{\mathrm{cap},z}_{j,\xi} \cdot \mathrm{W}^{z}_{j} \]

Process_injection

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

Process_opex

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

Process_output_arrival

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

risk_weighted_opex

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

scenario_opex

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

total_cost

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

Objective

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

Subject to

Bus_nodal_balance

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

Generator_ext_p_lower

\[ p_{g,\xi,t} \ge \underline{\mathrm{p}}_{g,\xi,t} \cdot \left( P_{g} - \gamma_{g,\xi} \cdot \mu^{\mathrm{nom}}_{g,\xi,t} \right) \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 \left( P_{g} - \gamma_{g,\xi} \cdot \mu^{\mathrm{nom}}_{g,\xi,t} \right) \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} \cdot \left( 1 - \gamma_{g,\xi} \cdot \mu_{g,\xi,t} \right) \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} \cdot \left( 1 - \gamma_{g,\xi} \cdot \mu_{g,\xi,t} \right) \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_maint_event_count

\[ \sum_{t \in \mathcal{T}} \mu^{\mathrm{up}}_{g,\xi,t} = \mathrm{n}^{\mathrm{mnt}}_{g,\xi} \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi \,:\, \mathrm{mnt}_{g} \]

Generator_maint_start_horizon

\[ \mu^{\mathrm{up}}_{g,\xi,t} = 0 \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{mnt}_{g} \wedge \mathrm{on}_{g,t} \wedge \mathrm{blk}_{g,\xi,t} \]

Generator_maint_window

\[ \mu_{g,\xi,t} = \sum_{t' \in \mathcal{T} \,:\, \left( t,\ g,\ \xi,\ t' \right) \in \mathrm{Generator\_maintenance\_cover}} \mu^{\mathrm{up}}_{g,\xi,t'} \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{mnt}_{g} \wedge \mathrm{on}_{g,t} \]

Generator_maintcap_lower_nommax

\[ \mu^{\mathrm{nom}}_{g,\xi,t} \ge P_{g} - \overline{\mathrm{p}}^{\mathrm{nom}}_{g,\xi} \cdot \left( 1 - \mu_{g,\xi,t} \right) \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Generator\_maint\_ext}_{g,t} \]

Generator_maintcap_lower_nommin

\[ \mu^{\mathrm{nom}}_{g,\xi,t} \ge \underline{\mathrm{p}}^{\mathrm{nom}}_{g,\xi} \cdot \mu_{g,\xi,t} \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Generator\_maint\_ext}_{g,t} \wedge \underline{\mathrm{p}}^{\mathrm{nom}}_{g,\xi} > 0 \]

Generator_maintcap_upper

\[ \mu^{\mathrm{nom}}_{g,\xi,t} \le P_{g} - \underline{\mathrm{p}}^{\mathrm{nom}}_{g,\xi} \cdot \left( 1 - \mu_{g,\xi,t} \right) \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Generator\_maint\_ext}_{g,t} \]

Generator_maintcap_upper_nommax

\[ \mu^{\mathrm{nom}}_{g,\xi,t} \le \overline{\mathrm{p}}^{\mathrm{nom}}_{g,\xi} \cdot \mu_{g,\xi,t} \qquad \forall\, g \in \mathcal{G},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Generator\_maint\_ext}_{g,t} \]

Link_ext_p_lower

\[ f_{l,\xi,t} \ge \underline{\mathrm{f}}_{l,\xi,t} \cdot \left( F_{l} - \gamma^{f}_{l,\xi} \cdot \mu^{f,\mathrm{nom}}_{l,\xi,t} \right) \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 \left( F_{l} - \gamma^{f}_{l,\xi} \cdot \mu^{f,\mathrm{nom}}_{l,\xi,t} \right) \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} \cdot \left( 1 - \gamma^{f}_{l,\xi} \cdot \mu^{f}_{l,\xi,t} \right) \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} \cdot \left( 1 - \gamma^{f}_{l,\xi} \cdot \mu^{f}_{l,\xi,t} \right) \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_maint_event_count

\[ \sum_{t \in \mathcal{T}} \mu^{f,\mathrm{up}}_{l,\xi,t} = \mathrm{n}^{f,\mathrm{mnt}}_{l,\xi} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi \,:\, \mathrm{mnt}^{f}_{l} \]

Link_maint_start_horizon

\[ \mu^{f,\mathrm{up}}_{l,\xi,t} = 0 \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{mnt}^{f}_{l} \wedge \mathrm{on}^{f}_{l,t} \wedge \mathrm{blk}^{f}_{l,\xi,t} \]

Link_maint_window

\[ \mu^{f}_{l,\xi,t} = \sum_{t' \in \mathcal{T} \,:\, \left( t,\ l,\ \xi,\ t' \right) \in \mathrm{Link\_maintenance\_cover}} \mu^{f,\mathrm{up}}_{l,\xi,t'} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{mnt}^{f}_{l} \wedge \mathrm{on}^{f}_{l,t} \]

Link_maintcap_lower_nommax

\[ \mu^{f,\mathrm{nom}}_{l,\xi,t} \ge F_{l} - \overline{\mathrm{f}}^{\mathrm{nom}}_{l,\xi} \cdot \left( 1 - \mu^{f}_{l,\xi,t} \right) \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Link\_maint\_ext}_{l,t} \]

Link_maintcap_lower_nommin

\[ \mu^{f,\mathrm{nom}}_{l,\xi,t} \ge \underline{\mathrm{f}}^{\mathrm{nom}}_{l,\xi} \cdot \mu^{f}_{l,\xi,t} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Link\_maint\_ext}_{l,t} \wedge \underline{\mathrm{f}}^{\mathrm{nom}}_{l,\xi} > 0 \]

Link_maintcap_upper

\[ \mu^{f,\mathrm{nom}}_{l,\xi,t} \le F_{l} - \underline{\mathrm{f}}^{\mathrm{nom}}_{l,\xi} \cdot \left( 1 - \mu^{f}_{l,\xi,t} \right) \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Link\_maint\_ext}_{l,t} \]

Link_maintcap_upper_nommax

\[ \mu^{f,\mathrm{nom}}_{l,\xi,t} \le \overline{\mathrm{f}}^{\mathrm{nom}}_{l,\xi} \cdot \mu^{f}_{l,\xi,t} \qquad \forall\, l \in \mathcal{L},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Link\_maint\_ext}_{l,t} \]

Process_ext_p_lower

\[ z_{j,\xi,t} \ge \underline{\mathrm{z}}_{j,\xi,t} \cdot \left( Z_{j} - \gamma^{z}_{j,\xi} \cdot \mu^{z,\mathrm{nom}}_{j,\xi,t} \right) \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{ext}^{z}_{j} \wedge \neg \mathrm{com}^{z}_{j} \wedge \mathrm{on}^{z}_{j,t} \]

Process_ext_p_nom_lower

\[ Z_{j} \ge \underline{\mathrm{z}}^{\mathrm{nom}}_{j,\xi} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi \,:\, \mathrm{ext}^{z}_{j} \wedge \mathrm{act}^{z}_{j} \]

Process_ext_p_nom_upper

\[ Z_{j} \le \overline{\mathrm{z}}^{\mathrm{nom}}_{j,\xi} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi \,:\, \mathrm{ext}^{z}_{j} \wedge \mathrm{act}^{z}_{j} \wedge \overline{\mathrm{z}}^{\mathrm{nom}}_{j,\xi} \text{ is defined} \]

Process_ext_p_upper

\[ z_{j,\xi,t} \le \overline{\mathrm{z}}_{j,\xi,t} \cdot \left( Z_{j} - \gamma^{z}_{j,\xi} \cdot \mu^{z,\mathrm{nom}}_{j,\xi,t} \right) \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{ext}^{z}_{j} \wedge \neg \mathrm{com}^{z}_{j} \wedge \mathrm{on}^{z}_{j,t} \]

Process_fix_p_lower

\[ z_{j,\xi,t} \ge \underline{\mathrm{z}}_{j,\xi,t} \cdot \mathrm{z}^{\mathrm{nom}}_{j,\xi} \cdot \left( 1 - \gamma^{z}_{j,\xi} \cdot \mu^{z}_{j,\xi,t} \right) \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \neg \mathrm{ext}^{z}_{j} \wedge \neg \mathrm{com}^{z}_{j} \wedge \mathrm{on}^{z}_{j,t} \]

Process_fix_p_upper

\[ z_{j,\xi,t} \le \overline{\mathrm{z}}_{j,\xi,t} \cdot \mathrm{z}^{\mathrm{nom}}_{j,\xi} \cdot \left( 1 - \gamma^{z}_{j,\xi} \cdot \mu^{z}_{j,\xi,t} \right) \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \neg \mathrm{ext}^{z}_{j} \wedge \neg \mathrm{com}^{z}_{j} \wedge \mathrm{on}^{z}_{j,t} \]

Process_maint_event_count

\[ \sum_{t \in \mathcal{T}} \mu^{z,\mathrm{up}}_{j,\xi,t} = \mathrm{n}^{z,\mathrm{mnt}}_{j,\xi} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi \,:\, \mathrm{mnt}^{z}_{j} \]

Process_maint_start_horizon

\[ \mu^{z,\mathrm{up}}_{j,\xi,t} = 0 \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{mnt}^{z}_{j} \wedge \mathrm{on}^{z}_{j,t} \wedge \mathrm{blk}^{z}_{j,\xi,t} \]

Process_maint_window

\[ \mu^{z}_{j,\xi,t} = \sum_{t' \in \mathcal{T} \,:\, \left( t,\ j,\ \xi,\ t' \right) \in \mathrm{Process\_maintenance\_cover}} \mu^{z,\mathrm{up}}_{j,\xi,t'} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{mnt}^{z}_{j} \wedge \mathrm{on}^{z}_{j,t} \]

Process_maintcap_lower_nommax

\[ \mu^{z,\mathrm{nom}}_{j,\xi,t} \ge Z_{j} - \overline{\mathrm{z}}^{\mathrm{nom}}_{j,\xi} \cdot \left( 1 - \mu^{z}_{j,\xi,t} \right) \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Process\_maint\_ext}_{j,t} \]

Process_maintcap_lower_nommin

\[ \mu^{z,\mathrm{nom}}_{j,\xi,t} \ge \underline{\mathrm{z}}^{\mathrm{nom}}_{j,\xi} \cdot \mu^{z}_{j,\xi,t} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Process\_maint\_ext}_{j,t} \wedge \underline{\mathrm{z}}^{\mathrm{nom}}_{j,\xi} > 0 \]

Process_maintcap_upper

\[ \mu^{z,\mathrm{nom}}_{j,\xi,t} \le Z_{j} - \underline{\mathrm{z}}^{\mathrm{nom}}_{j,\xi} \cdot \left( 1 - \mu^{z}_{j,\xi,t} \right) \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Process\_maint\_ext}_{j,t} \]

Process_maintcap_upper_nommax

\[ \mu^{z,\mathrm{nom}}_{j,\xi,t} \le \overline{\mathrm{z}}^{\mathrm{nom}}_{j,\xi} \cdot \mu^{z}_{j,\xi,t} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Process\_maint\_ext}_{j,t} \]

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

version: 0
description: The file states a plain `n.optimize()`, its multi-period class under the `multi_investment_periods`
  keyword, and its stochastic class, which `n.set_scenarios(...)` sets. Every quantity chosen once the
  future is known (second-stage) spans the futures dispatch is chosen in (`scenario`). Capacity is chosen
  once, before the future is known, and paid at its expected cost in each investment `period` its build
  year and lifetime span. Operation is the expectation over the scenarios' weights, with a share priced
  at the worst-outcome mean cost (CVaR) only where a risk preference is set. A plain run's data has one
  scenario, one period, unit weights, no outage and every `active` flag true, so the problem is the standard
  one. On a security-constrained run, PyPSA copies each branch flow limit once per `outage`, and the outage
  factors, `active` flags and scenario weights come from data prep.
dimensions:
  breakpoint: {dtype: int, ordered: true, description: 'the corners of a piecewise-linear curve, in order.
      A curve runs over the breakpoints its data has rows for, so curves may differ in length'}
  bus: {description: network nodes}
  generator: {description: 'generating units, each on one bus'}
  link: {description: 'controllable connections, each from one bus to the buses it delivers to'}
  link_output: {description: 'a link''s output ports, one label per port a link declares. The labels are
      PyPSA''s `bus1`, `bus2`, … columns read long, data prep. A link of any number of output ports is
      then one term in the balance'}
  load: {description: 'demands, each on one bus'}
  period: {dtype: int, ordered: true, description: investment periods. It is PyPSA's `investment_periods`}
  process: {description: 'generalised multi-port converters, each with an internal power that every port
      draws or delivers at its own rate'}
  process_output: {description: 'a process''s ports, one label per port a process declares. The labels
      are PyPSA''s `bus0`, `bus1`, …, each with a signed `rate`, data prep. A process of any number of
      ports is then one term in the balance'}
  scenario: {description: 'the futures dispatch is chosen in, each with a weight'}
  snapshot: {dtype: datetime, ordered: true, description: dispatch periods}
relations:
  Generator_bus: {key: generator, values: bus, description: the bus a generator sits on}
  Generator_maintenance_cover:
    key:
      covered: snapshot
      generator: generator
      scenario: scenario
      start: snapshot
    missing: absent
    description: the snapshots a maintenance event covers, by the snapshot it starts in, data prep. In
      a scenario, they are the start and the snapshots after it, until their generator weightings reach
      that scenario's `maintenance_duration`. A generator that is not maintainable has no rows
  Link_bus0: {key: link, values: bus, description: the bus a link leaves}
  Link_maintenance_cover:
    key:
      covered: snapshot
      link: link
      scenario: scenario
      start: snapshot
    missing: absent
    description: the snapshots a maintenance event covers, by the snapshot it starts in, data prep. In
      a scenario, they are the start and the snapshots after it, until their generator weightings reach
      that scenario's `maintenance_duration`. A link that is not maintainable has no rows
  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_maintenance_cover:
    key:
      covered: snapshot
      process: process
      scenario: scenario
      start: snapshot
    missing: absent
    description: the snapshots a maintenance event covers, by the snapshot it starts in, data prep. In
      a scenario, they are the start and the snapshots after it, until their generator weightings reach
      that scenario's `maintenance_duration`. A process that is not maintainable has no rows
  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}
  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_maintainable:
    dims: [generator]
    dtype: bool
    description: 'whether a generator must be taken off for maintenance within the horizon: in any scenario,
      as PyPSA takes the union over them (`components.py:1000-1003`)'
  Generator_maintenance_events:
    dims: [generator, scenario]
    dtype: int
    description: how many maintenance events occur within the horizon
  Generator_maintenance_pu:
    dims: [generator, scenario]
    description: the share of the build a maintenance event takes off
  Generator_maintenance_start_blocked:
    dims: [generator, scenario, snapshot]
    dtype: bool
    description: true where no maintenance event may start, data prep. The snapshots it would cover there
      run past the end of the horizon or into one the generator is not active in. It is PyPSA's `active
      & ~valid`, from `maintenance_duration` and the generator weightings
  Generator_marginal_cost:
    dims: [generator, scenario, snapshot]
    description: cost of one unit of output
  Generator_marginal_cost_curve_p:
    dims: [breakpoint, generator]
    missing: absent
    description: 'the output at each breakpoint of a generator''s piecewise `marginal_cost` curve: PyPSA''s
      `p_pu` breakpoints times `p_nom`, data prep. A generator with no curve has no rows'
  Generator_marginal_cost_quadratic:
    dims: [generator, scenario, snapshot]
    description: cost of the square of one unit of output
  Generator_p_max_pu:
    dims: [generator, scenario, snapshot]
    description: 'most output, per unit of nominal power: an availability profile'
  Generator_p_min_pu:
    dims: [generator, scenario, snapshot]
    description: least output, per unit of nominal power
  Generator_p_nom:
    dims: [generator, scenario]
    description: nominal power
  Generator_p_nom_extendable:
    dims: [generator]
    dtype: bool
    description: whether the nominal power is a decision
  Generator_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_sign:
    dims: [generator]
    description: the sign output enters its bus's balance with. It is PyPSA's `sign`, `1` unless given,
      `-1` for a unit that draws power. PyPSA refuses one that differs by scenario (`constants.py:46`)
  Link_active:
    dims: [link, snapshot]
    dtype: bool
    description: whether a link is active in a snapshot's period. It is PyPSA's `active`, data prep
  Link_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_maintainable:
    dims: [link]
    dtype: bool
    description: 'whether a link must be taken off for maintenance within the horizon: in any scenario,
      as PyPSA takes the union over them (`components.py:1000-1003`)'
  Link_maintenance_events:
    dims: [link, scenario]
    dtype: int
    description: how many maintenance events occur within the horizon
  Link_maintenance_pu:
    dims: [link, scenario]
    description: the share of the build a maintenance event takes off
  Link_maintenance_start_blocked:
    dims: [link, scenario, snapshot]
    dtype: bool
    description: true where no maintenance event may start, data prep. The snapshots it would cover there
      run past the end of the horizon or into one the link is not active in. It is PyPSA's `active & ~valid`,
      from `maintenance_duration` and the generator weightings
  Link_marginal_cost:
    dims: [link, scenario, snapshot]
    description: cost of one unit of flow
  Link_marginal_cost_quadratic:
    dims: [link, scenario, snapshot]
    description: cost of the square of one unit of flow
  Link_output_cyclic_delay:
    dims: [link_output]
    dtype: bool
    description: whether a delayed port's flow wraps from the end of its investment period (PyPSA's `cyclic_delay`,
      `cyclic_delay2`, …). Where it does not, the flow still in transit at each period's first snapshots
      is lost. The flag is the same in every scenario, as the delay is
  Link_output_delay:
    dims: [link_output]
    dtype: int
    description: snapshots a port's delivery lags its link's flow (PyPSA's `delay`, `delay2`, … read long).
      In data prep you divide it by the `snapshot_weightings.generators` value and round it up. It is
      zero for a port that delivers at once. A port has the same delay in every scenario, because PyPSA
      refuses a delay that differs by scenario (`constants.py:55`)
  Link_p_max_pu:
    dims: [link, scenario, snapshot]
    description: most flow, per unit of nominal power
  Link_p_min_pu:
    dims: [link, scenario, snapshot]
    description: 'least flow, per unit of nominal power: negative for a link that carries both ways'
  Link_p_nom:
    dims: [link, scenario]
    description: nominal power
  Link_p_nom_extendable:
    dims: [link]
    dtype: bool
    description: whether the nominal power is a decision
  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
  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_active_asset:
    dims: [process]
    dtype: bool
    description: whether a process 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`)
  Process_capital_cost:
    dims: [process, 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`)
  Process_capital_weight:
    dims: [process]
    description: the sum of period weights a process is active in. It is PyPSA's `active * period_weighting`,
      summed, data prep
  Process_committable:
    dims: [process]
    dtype: bool
    description: whether internal power is gated by an on/off status decision
  Process_maintainable:
    dims: [process]
    dtype: bool
    description: 'whether a process must be taken off for maintenance within the horizon: in any scenario,
      as PyPSA takes the union over them (`components.py:1000-1003`)'
  Process_maintenance_events:
    dims: [process, scenario]
    dtype: int
    description: how many maintenance events occur within the horizon
  Process_maintenance_pu:
    dims: [process, scenario]
    description: the share of the build a maintenance event takes off
  Process_maintenance_start_blocked:
    dims: [process, scenario, snapshot]
    dtype: bool
    description: true where no maintenance event may start, data prep. The snapshots it would cover there
      run past the end of the horizon or into one the process is not active in. It is PyPSA's `active
      & ~valid`, from `maintenance_duration` and the generator weightings
  Process_marginal_cost:
    dims: [process, scenario, snapshot]
    description: cost of one unit of internal power
  Process_marginal_cost_quadratic:
    dims: [process, scenario, snapshot]
    description: cost of the square of one unit of internal power
  Process_output_cyclic_delay:
    dims: [process_output]
    dtype: bool
    description: whether a delayed port's transfer wraps from the end of its investment period (PyPSA's
      `cyclic_delay0`, `cyclic_delay1`, …). Where it does not, the energy still in transit at each period's
      first snapshots is lost. The flag is the same in every scenario, as the delay is
  Process_output_delay:
    dims: [process_output]
    dtype: int
    description: snapshots a port's transfer lags its process's internal power (PyPSA's `delay0`, `delay1`,
      … read long). In data prep you divide it by the `snapshot_weightings.generators` value and round
      it up. It is zero for a port that transfers at once. A port has the same delay in every scenario,
      as a link's port has
  Process_p_max_pu:
    dims: [process, scenario, snapshot]
    description: most internal power, per unit of nominal power
  Process_p_min_pu:
    dims: [process, scenario, snapshot]
    description: 'least internal power, per unit of nominal power: negative for a process that runs both
      ways'
  Process_p_nom:
    dims: [process, scenario]
    description: nominal internal power
  Process_p_nom_extendable:
    dims: [process]
    dtype: bool
    description: whether the nominal internal power is a decision
  Process_p_nom_max:
    dims: [process, scenario]
    description: most nominal power an extendable process may be built at
  Process_p_nom_min:
    dims: [process, scenario]
    description: least nominal power an extendable process may be built at
  Process_p_nom_mod:
    dims: [process]
    missing: absent
    description: the module size a build comes in whole numbers of. No value means the build is continuous
  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`)
  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`)
  scenario_weight:
    dims: [scenario]
    description: PyPSA's `scenario_weightings.weight` — the probability of a future
  snapshot_weightings_objective:
    dims: [snapshot]
    description: PyPSA's `snapshot_weightings.objective` — hours a snapshot weighs in the cost
variables:
  Generator_maintenance:
    dims: [generator, scenario, snapshot]
    where: Generator_maintainable AND Generator_active
    bounds: {lower: 0.0, upper: 1.0}
    missing: 0.0
    description: '`Generator-maintenance` — whether a maintainable generator is in maintenance: continuous,
      and one exactly where an event covers the snapshot'
  Generator_maintenance_capacity:
    dims: [generator, scenario, snapshot]
    where: Generator_maint_ext
    bounds: {lower: 0.0}
    missing: 0.0
    description: '`Generator-maintenance_capacity` — the chosen build while in maintenance, zero otherwise:
      the product the `maintcap` rows linearise'
  Generator_maintenance_start:
    dims: [generator, scenario, snapshot]
    where: Generator_maintainable AND Generator_active
    domain: binary
    missing: 0.0
    description: '`Generator-maintenance_start` — whether a maintenance event starts in this snapshot'
  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_maintenance:
    dims: [link, scenario, snapshot]
    where: Link_maintainable AND Link_active
    bounds: {lower: 0.0, upper: 1.0}
    missing: 0.0
    description: '`Link-maintenance` — whether a maintainable link is in maintenance: continuous, and
      one exactly where an event covers the snapshot'
  Link_maintenance_capacity:
    dims: [link, scenario, snapshot]
    where: Link_maint_ext
    bounds: {lower: 0.0}
    missing: 0.0
    description: '`Link-maintenance_capacity` — the chosen build while in maintenance, zero otherwise:
      the product the `maintcap` rows linearise'
  Link_maintenance_start:
    dims: [link, scenario, snapshot]
    where: Link_maintainable AND Link_active
    domain: binary
    missing: 0.0
    description: '`Link-maintenance_start` — whether a maintenance event starts in this snapshot'
  Link_p:
    dims: [link, scenario, snapshot]
    where: Link_active
    description: '`Link-p` — PyPSA''s `p0`, the flow measured at the `Link_bus0` end. A positive value
      withdraws there and injects at every bus the link''s output ports deliver to'
  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'
  Process_maintenance:
    dims: [process, scenario, snapshot]
    where: Process_maintainable AND Process_active
    bounds: {lower: 0.0, upper: 1.0}
    missing: 0.0
    description: '`Process-maintenance` — whether a maintainable process is in maintenance: continuous,
      and one exactly where an event covers the snapshot'
  Process_maintenance_capacity:
    dims: [process, scenario, snapshot]
    where: Process_maint_ext
    bounds: {lower: 0.0}
    missing: 0.0
    description: '`Process-maintenance_capacity` — the chosen build while in maintenance, zero otherwise:
      the product the `maintcap` rows linearise'
  Process_maintenance_start:
    dims: [process, scenario, snapshot]
    where: Process_maintainable AND Process_active
    domain: binary
    missing: 0.0
    description: '`Process-maintenance_start` — whether a maintenance event starts in this snapshot'
  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'
  Process_p_nom_ext:
    dims: [process]
    where: Process_p_nom_extendable AND Process_active_asset
    description: '`Process-p_nom` — nominal internal power where it is a decision, for a process that
      is active. A fixed build is the parameter of the same PyPSA name'
  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_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 - Generator_maintenance_pu *
      Generator_maintenance_capacity)
    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 - Generator_maintenance_pu *
      Generator_maintenance_capacity)
    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 * (1 - Generator_maintenance_pu *
      Generator_maintenance)
    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 * (1 - Generator_maintenance_pu *
      Generator_maintenance)
    description: '`Generator-fix-p-upper` — a fixed generator outputs at most what is available'
  Generator_maint_event_count:
    dims: [generator, scenario]
    where: Generator_maintainable
    expression: sum(Generator_maintenance_start, over=snapshot) == Generator_maintenance_events
    description: '`Generator-maint-event-count` — a maintainable generator holds its number of maintenance
      events over the horizon'
  Generator_maint_start_horizon:
    dims: [generator, scenario, snapshot]
    where: Generator_maintainable AND Generator_active AND Generator_maintenance_start_blocked
    expression: Generator_maintenance_start == 0
    description: '`Generator-maint-start-horizon` — no event starts where it could not run its whole duration'
  Generator_maint_window:
    dims: [generator, scenario, snapshot]
    where: Generator_maintainable AND Generator_active
    expression: Generator_maintenance == sum(Generator_maintenance_start, over=start, by=Generator_maintenance_cover[covered])
    description: '`Generator-maint-window` — a generator is in maintenance exactly where an event it started
      covers the snapshot. Two events do not overlap, since the maintenance status is at most one'
  Generator_maintcap_lower_nommax:
    dims: [generator, scenario, snapshot]
    where: Generator_maint_ext
    expression: Generator_maintenance_capacity >= Generator_p_nom_ext - Generator_p_nom_max * (1 - Generator_maintenance)
    description: '`Generator-maintcap_lower_nommax` — in maintenance, the whole chosen build is taken
      off'
  Generator_maintcap_lower_nommin:
    dims: [generator, scenario, snapshot]
    where: Generator_maint_ext AND Generator_p_nom_min > 0
    expression: Generator_maintenance_capacity >= Generator_p_nom_min * Generator_maintenance
    description: '`Generator-maintcap_lower_nommin` — in maintenance, at least the floor of the build
      is taken off'
  Generator_maintcap_upper:
    dims: [generator, scenario, snapshot]
    where: Generator_maint_ext
    expression: Generator_maintenance_capacity <= Generator_p_nom_ext - Generator_p_nom_min * (1 - Generator_maintenance)
    description: '`Generator-maintcap_upper` — the build taken off is at most the chosen build in maintenance,
      and at most the build less its floor out of it'
  Generator_maintcap_upper_nommax:
    dims: [generator, scenario, snapshot]
    where: Generator_maint_ext
    expression: Generator_maintenance_capacity <= Generator_p_nom_max * Generator_maintenance
    description: '`Generator-maintcap_upper_nommax` — out of maintenance, no build is taken off'
  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 - Link_maintenance_pu * Link_maintenance_capacity)
    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 - Link_maintenance_pu * Link_maintenance_capacity)
    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 * (1 - Link_maintenance_pu * Link_maintenance)
    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 * (1 - Link_maintenance_pu * Link_maintenance)
    description: '`Link-fix-p-upper` — a fixed link carries at most its nominal power'
  Link_maint_event_count:
    dims: [link, scenario]
    where: Link_maintainable
    expression: sum(Link_maintenance_start, over=snapshot) == Link_maintenance_events
    description: '`Link-maint-event-count` — a maintainable link holds its number of maintenance events
      over the horizon'
  Link_maint_start_horizon:
    dims: [link, scenario, snapshot]
    where: Link_maintainable AND Link_active AND Link_maintenance_start_blocked
    expression: Link_maintenance_start == 0
    description: '`Link-maint-start-horizon` — no event starts where it could not run its whole duration'
  Link_maint_window:
    dims: [link, scenario, snapshot]
    where: Link_maintainable AND Link_active
    expression: Link_maintenance == sum(Link_maintenance_start, over=start, by=Link_maintenance_cover[covered])
    description: '`Link-maint-window` — a link is in maintenance exactly where an event it started covers
      the snapshot. Two events do not overlap, since the maintenance status is at most one'
  Link_maintcap_lower_nommax:
    dims: [link, scenario, snapshot]
    where: Link_maint_ext
    expression: Link_maintenance_capacity >= Link_p_nom_ext - Link_p_nom_max * (1 - Link_maintenance)
    description: '`Link-maintcap_lower_nommax` — in maintenance, the whole chosen build is taken off'
  Link_maintcap_lower_nommin:
    dims: [link, scenario, snapshot]
    where: Link_maint_ext AND Link_p_nom_min > 0
    expression: Link_maintenance_capacity >= Link_p_nom_min * Link_maintenance
    description: '`Link-maintcap_lower_nommin` — in maintenance, at least the floor of the build is taken
      off'
  Link_maintcap_upper:
    dims: [link, scenario, snapshot]
    where: Link_maint_ext
    expression: Link_maintenance_capacity <= Link_p_nom_ext - Link_p_nom_min * (1 - Link_maintenance)
    description: '`Link-maintcap_upper` — the build taken off is at most the chosen build in maintenance,
      and at most the build less its floor out of it'
  Link_maintcap_upper_nommax:
    dims: [link, scenario, snapshot]
    where: Link_maint_ext
    expression: Link_maintenance_capacity <= Link_p_nom_max * Link_maintenance
    description: '`Link-maintcap_upper_nommax` — out of maintenance, no build is taken off'
  Process_ext_p_lower:
    dims: [process, scenario, snapshot]
    where: Process_p_nom_extendable AND not Process_committable AND Process_active
    expression: Process_p >= Process_p_min_pu * (Process_p_nom_ext - Process_maintenance_pu * Process_maintenance_capacity)
    description: '`Process-ext-p-lower` — an extendable process runs at least its minimum of the chosen
      build, negative for the other way'
  Process_ext_p_nom_lower:
    dims: [process, scenario]
    where: Process_p_nom_extendable AND Process_active_asset
    expression: Process_p_nom_ext >= Process_p_nom_min
    description: '`Process-ext-p_nom-lower` — the chosen build is at least its floor in every scenario'
  Process_ext_p_nom_upper:
    dims: [process, scenario]
    where: Process_p_nom_extendable AND Process_active_asset AND Process_p_nom_max
    expression: Process_p_nom_ext <= Process_p_nom_max
    description: '`Process-ext-p_nom-upper` — the chosen build is at most its cap in every scenario. A
      cap of infinity is no row'
  Process_ext_p_upper:
    dims: [process, scenario, snapshot]
    where: Process_p_nom_extendable AND not Process_committable AND Process_active
    expression: Process_p <= Process_p_max_pu * (Process_p_nom_ext - Process_maintenance_pu * Process_maintenance_capacity)
    description: '`Process-ext-p-upper` — an extendable process runs at most the chosen build'
  Process_fix_p_lower:
    dims: [process, scenario, snapshot]
    where: not Process_p_nom_extendable AND not Process_committable AND Process_active
    expression: Process_p >= Process_p_min_pu * Process_p_nom * (1 - Process_maintenance_pu * Process_maintenance)
    description: '`Process-fix-p-lower` — a fixed process runs at least its minimum, negative for the
      other way'
  Process_fix_p_upper:
    dims: [process, scenario, snapshot]
    where: not Process_p_nom_extendable AND not Process_committable AND Process_active
    expression: Process_p <= Process_p_max_pu * Process_p_nom * (1 - Process_maintenance_pu * Process_maintenance)
    description: '`Process-fix-p-upper` — a fixed process runs at most its nominal power'
  Process_maint_event_count:
    dims: [process, scenario]
    where: Process_maintainable
    expression: sum(Process_maintenance_start, over=snapshot) == Process_maintenance_events
    description: '`Process-maint-event-count` — a maintainable process holds its number of maintenance
      events over the horizon'
  Process_maint_start_horizon:
    dims: [process, scenario, snapshot]
    where: Process_maintainable AND Process_active AND Process_maintenance_start_blocked
    expression: Process_maintenance_start == 0
    description: '`Process-maint-start-horizon` — no event starts where it could not run its whole duration'
  Process_maint_window:
    dims: [process, scenario, snapshot]
    where: Process_maintainable AND Process_active
    expression: Process_maintenance == sum(Process_maintenance_start, over=start, by=Process_maintenance_cover[covered])
    description: '`Process-maint-window` — a process is in maintenance exactly where an event it started
      covers the snapshot. Two events do not overlap, since the maintenance status is at most one'
  Process_maintcap_lower_nommax:
    dims: [process, scenario, snapshot]
    where: Process_maint_ext
    expression: Process_maintenance_capacity >= Process_p_nom_ext - Process_p_nom_max * (1 - Process_maintenance)
    description: '`Process-maintcap_lower_nommax` — in maintenance, the whole chosen build is taken off'
  Process_maintcap_lower_nommin:
    dims: [process, scenario, snapshot]
    where: Process_maint_ext AND Process_p_nom_min > 0
    expression: Process_maintenance_capacity >= Process_p_nom_min * Process_maintenance
    description: '`Process-maintcap_lower_nommin` — in maintenance, at least the floor of the build is
      taken off'
  Process_maintcap_upper:
    dims: [process, scenario, snapshot]
    where: Process_maint_ext
    expression: Process_maintenance_capacity <= Process_p_nom_ext - Process_p_nom_min * (1 - Process_maintenance)
    description: '`Process-maintcap_upper` — the build taken off is at most the chosen build in maintenance,
      and at most the build less its floor out of it'
  Process_maintcap_upper_nommax:
    dims: [process, scenario, snapshot]
    where: Process_maint_ext
    expression: Process_maintenance_capacity <= Process_p_nom_max * Process_maintenance
    description: '`Process-maintcap_upper_nommax` — out of maintenance, no build is taken off'
expressions:
  Bus_injection:
    dims: [bus, scenario, snapshot]
    expression: ((Generator_injection + Link_injection) + Load_injection) + Process_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_running_cost:
    dims: [generator, scenario, snapshot]
    description: 'what a generator''s output costs in a snapshot: the value read off its piecewise curve
      where it has one, and its linear `marginal_cost` otherwise. A curve replaces the linear cost, as
      PyPSA drops the unit from that term (`optimize.py:333-348`)'
    cases:
      curve: {when: Generator_marginal_cost_curve, expression: Generator_marginal_cost_piecewise}
    otherwise: Generator_p * Generator_marginal_cost
  Link_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
  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_capex: {expression: sum(scenario_weight * Process_p_nom_ext * Process_capital_cost * Process_capital_weight)}
  Process_injection: {expression: 'sum(Process_output_arrival, over=process_output, by=Process_output_bus[bus])'}
  Process_opex: {expression: 'sum(sum(((Process_p * Process_marginal_cost) * snapshot_weightings_objective)
      * at(period_weight_objective, by=snapshot_period[period]), over=process), over=snapshot) + sum(sum((((Process_p
      * Process_p) * Process_marginal_cost_quadratic) * snapshot_weightings_objective) * at(period_weight_objective,
      by=snapshot_period[period]), over=process), over=snapshot)'}
  Process_output_arrival:
    dims: [process_output, scenario, snapshot]
    description: what a process transfers at a port at a snapshot. It is its internal power delayed by
      the port's `delay` within its investment period. It is multiplied by the port's rate at the snapshot
      the transfer arrives. Where the port is `cyclic_delay`, the delayed transfer wraps from the period's
      end. Where it is not, the energy still in transit at the period's first snapshots is lost. A port
      that does not delay (`delay` zero) transfers at once, cyclic or not
    cases:
      wrapping: {when: Process_output_cyclic_delay, expression: 'shift(at(Process_p, by=Process_output_process[process]),
          along=snapshot, offset=Process_output_delay, edge=''wrap'', within=snapshot_period[period])
          * Process_rate'}
    otherwise: shift(at(Process_p, by=Process_output_process[process]), along=snapshot, offset=Process_output_delay,
      edge=0, within=snapshot_period[period]) * Process_rate
  risk_weighted_opex: {expression: 'sum(scenario_weight * scenario_opex, over=scenario)'}
  scenario_opex:
    dims: [scenario]
    expression: (Generator_opex + Link_opex) + Process_opex
    description: 'what a future costs to run: every operating term, weighted by the snapshot''s hours
      and its period, before the scenario''s own weight. A start and a stop cost what they cost, unweighted,
      as PyPSA adds them (`optimize.py:448-468`)'
  total_cost:
    dims: []
    expression: ((Generator_capex + Link_capex) + Process_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
conditions:
  Generator_maint_ext: {condition: Generator_maintainable AND Generator_p_nom_extendable AND NOT (Generator_committable
      AND Generator_p_nom_mod > 0) AND Generator_active, description: 'a maintainable generator with an
      extendable build that is active in the snapshot''s period, unless it is committable and modular.
      These are the maintenance rows against the chosen build'}
  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`)'}
  Link_maint_ext: {condition: Link_maintainable AND Link_p_nom_extendable AND NOT (Link_committable AND
      Link_p_nom_mod > 0) AND Link_active, description: 'a maintainable link with an extendable build
      that is active in the snapshot''s period, unless it is committable and modular. These are the maintenance
      rows against the chosen build'}
  Process_maint_ext: {condition: Process_maintainable AND Process_p_nom_extendable AND NOT (Process_committable
      AND Process_p_nom_mod > 0) AND Process_active, description: 'a maintainable process with an extendable
      build that is active in the snapshot''s period, unless it is committable and modular. These are
      the maintenance rows against the chosen build'}
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


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'),
    '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_objective': weighting(n, 'objective'),
}

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

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

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

"""Rung 33: maintenance — a fixed and an extendable generator, link and process, each taken off for events that the generator weightings time."""

from __future__ import annotations

import spine


def build():
    """The spine plus an east bus and six maintainable components, fixed and extendable, with a dear peaker to cover them."""
    n = spine.build()
    n.add('Bus', 'east')
    n.add('Generator', 'hydro', bus='north', p_nom=50, marginal_cost=2, maintainable=True, maintenance_duration=3)
    n.add(
        'Generator',
        'wind_ext',
        bus='south',
        p_nom_extendable=True,
        p_nom_min=10,
        p_nom_max=60,
        capital_cost=20,
        marginal_cost=1,
        p_max_pu=[0.9, 0.6, 0.8, 0.7],
        maintainable=True,
        maintenance_duration=2,
        maintenance_pu=0.5,
    )
    n.add(
        'Link',
        'tie_fix',
        bus0='north',
        bus1='east',
        p_nom=30,
        efficiency=0.95,
        maintainable=True,
        maintenance_duration=1,
        maintenance_events=2,
    )
    n.add(
        'Link',
        'tie_ext',
        bus0='south',
        bus1='east',
        p_nom_extendable=True,
        p_nom_min=5,
        p_nom_max=40,
        capital_cost=4,
        efficiency=0.9,
        p_min_pu=-1,
        maintainable=True,
        maintenance_duration=3,
    )
    n.add(
        'Process',
        'conv_fix',
        bus0='north',
        bus1='east',
        rate0=-1.25,
        p_nom=25,
        maintainable=True,
        maintenance_duration=3,
        maintenance_pu=0.6,
    )
    n.add(
        'Process',
        'conv_ext',
        bus0='south',
        bus1='east',
        rate0=-1.25,
        p_nom_extendable=True,
        p_nom_min=5,
        p_nom_max=30,
        capital_cost=3,
        maintainable=True,
        maintenance_duration=1,
    )
    n.add('Generator', 'east_peak', bus='east', p_nom=100, marginal_cost=60)
    n.add('Load', 'east_load', bus='east', p_set=[50, 60, 40, 55])
    return n
n = build()
n.optimize(solver_name='highs')
n.objective  # 7367.560185

The data

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

Generator_maintainable.csv

generator,value
coal,false
east_peak,false
gas,false
hydro,true
wind_ext,true

Generator_maintenance_cover.csv

covered,generator,scenario,start
2015-01-01T00:00:00.000000,hydro,base,2015-01-01T00:00:00.000000
2015-01-01T00:00:00.000000,wind_ext,base,2015-01-01T00:00:00.000000
2015-01-01T01:00:00.000000,hydro,base,2015-01-01T00:00:00.000000
2015-01-01T01:00:00.000000,hydro,base,2015-01-01T01:00:00.000000
2015-01-01T01:00:00.000000,wind_ext,base,2015-01-01T00:00:00.000000
2015-01-01T01:00:00.000000,wind_ext,base,2015-01-01T01:00:00.000000
2015-01-01T02:00:00.000000,hydro,base,2015-01-01T00:00:00.000000
2015-01-01T02:00:00.000000,hydro,base,2015-01-01T01:00:00.000000
2015-01-01T02:00:00.000000,hydro,base,2015-01-01T02:00:00.000000
2015-01-01T02:00:00.000000,wind_ext,base,2015-01-01T01:00:00.000000
2015-01-01T02:00:00.000000,wind_ext,base,2015-01-01T02:00:00.000000
2015-01-01T03:00:00.000000,hydro,base,2015-01-01T03:00:00.000000
2015-01-01T03:00:00.000000,wind_ext,base,2015-01-01T03:00:00.000000

Generator_maintenance_events.csv

generator,scenario,value
coal,base,1
east_peak,base,1
gas,base,1
hydro,base,1
wind_ext,base,1

Generator_maintenance_pu.csv

generator,scenario,value
coal,base,1.0
east_peak,base,1.0
gas,base,1.0
hydro,base,1.0
wind_ext,base,0.5

Generator_maintenance_start_blocked.csv

generator,scenario,snapshot,value
coal,base,2015-01-01T00:00:00.000000,false
coal,base,2015-01-01T01:00:00.000000,false
coal,base,2015-01-01T02:00:00.000000,false
coal,base,2015-01-01T03:00:00.000000,false
east_peak,base,2015-01-01T00:00:00.000000,false
east_peak,base,2015-01-01T01:00:00.000000,false
east_peak,base,2015-01-01T02:00:00.000000,false
east_peak,base,2015-01-01T03:00:00.000000,false
gas,base,2015-01-01T00:00:00.000000,false
gas,base,2015-01-01T01:00:00.000000,false
gas,base,2015-01-01T02:00:00.000000,false
gas,base,2015-01-01T03:00:00.000000,false
hydro,base,2015-01-01T00:00:00.000000,false
hydro,base,2015-01-01T01:00:00.000000,false
hydro,base,2015-01-01T02:00:00.000000,false
hydro,base,2015-01-01T03:00:00.000000,true
wind_ext,base,2015-01-01T00:00:00.000000,false
wind_ext,base,2015-01-01T01:00:00.000000,false
wind_ext,base,2015-01-01T02:00:00.000000,false
wind_ext,base,2015-01-01T03:00:00.000000,false

Link_maintainable.csv

link,value
tie_ext,true
tie_fix,true
wire,false

Link_maintenance_cover.csv

covered,link,scenario,start
2015-01-01T00:00:00.000000,tie_ext,base,2015-01-01T00:00:00.000000
2015-01-01T00:00:00.000000,tie_fix,base,2015-01-01T00:00:00.000000
2015-01-01T01:00:00.000000,tie_ext,base,2015-01-01T00:00:00.000000
2015-01-01T01:00:00.000000,tie_ext,base,2015-01-01T01:00:00.000000
2015-01-01T01:00:00.000000,tie_fix,base,2015-01-01T01:00:00.000000
2015-01-01T02:00:00.000000,tie_ext,base,2015-01-01T00:00:00.000000
2015-01-01T02:00:00.000000,tie_ext,base,2015-01-01T01:00:00.000000
2015-01-01T02:00:00.000000,tie_ext,base,2015-01-01T02:00:00.000000
2015-01-01T02:00:00.000000,tie_fix,base,2015-01-01T01:00:00.000000
2015-01-01T02:00:00.000000,tie_fix,base,2015-01-01T02:00:00.000000
2015-01-01T03:00:00.000000,tie_ext,base,2015-01-01T03:00:00.000000
2015-01-01T03:00:00.000000,tie_fix,base,2015-01-01T03:00:00.000000

Link_maintenance_events.csv

link,scenario,value
tie_ext,base,1
tie_fix,base,2
wire,base,1

Link_maintenance_pu.csv

link,scenario,value
tie_ext,base,1.0
tie_fix,base,1.0
wire,base,1.0

Link_maintenance_start_blocked.csv

link,scenario,snapshot,value
tie_ext,base,2015-01-01T00:00:00.000000,false
tie_ext,base,2015-01-01T01:00:00.000000,false
tie_ext,base,2015-01-01T02:00:00.000000,false
tie_ext,base,2015-01-01T03:00:00.000000,true
tie_fix,base,2015-01-01T00:00:00.000000,false
tie_fix,base,2015-01-01T01:00:00.000000,false
tie_fix,base,2015-01-01T02:00:00.000000,false
tie_fix,base,2015-01-01T03:00:00.000000,false
wire,base,2015-01-01T00:00:00.000000,false
wire,base,2015-01-01T01:00:00.000000,false
wire,base,2015-01-01T02:00:00.000000,false
wire,base,2015-01-01T03:00:00.000000,false

Process_maintainable.csv

process,value
conv_ext,true
conv_fix,true

Process_maintenance_cover.csv

covered,process,scenario,start
2015-01-01T00:00:00.000000,conv_ext,base,2015-01-01T00:00:00.000000
2015-01-01T00:00:00.000000,conv_fix,base,2015-01-01T00:00:00.000000
2015-01-01T01:00:00.000000,conv_ext,base,2015-01-01T01:00:00.000000
2015-01-01T01:00:00.000000,conv_fix,base,2015-01-01T00:00:00.000000
2015-01-01T01:00:00.000000,conv_fix,base,2015-01-01T01:00:00.000000
2015-01-01T02:00:00.000000,conv_ext,base,2015-01-01T01:00:00.000000
2015-01-01T02:00:00.000000,conv_ext,base,2015-01-01T02:00:00.000000
2015-01-01T02:00:00.000000,conv_fix,base,2015-01-01T00:00:00.000000
2015-01-01T02:00:00.000000,conv_fix,base,2015-01-01T01:00:00.000000
2015-01-01T02:00:00.000000,conv_fix,base,2015-01-01T02:00:00.000000
2015-01-01T03:00:00.000000,conv_ext,base,2015-01-01T03:00:00.000000
2015-01-01T03:00:00.000000,conv_fix,base,2015-01-01T03:00:00.000000

Process_maintenance_events.csv

process,scenario,value
conv_ext,base,1
conv_fix,base,1

Process_maintenance_pu.csv

process,scenario,value
conv_ext,base,1.0
conv_fix,base,0.6

Process_maintenance_start_blocked.csv

process,scenario,snapshot,value
conv_ext,base,2015-01-01T00:00:00.000000,false
conv_ext,base,2015-01-01T01:00:00.000000,false
conv_ext,base,2015-01-01T02:00:00.000000,false
conv_ext,base,2015-01-01T03:00:00.000000,false
conv_fix,base,2015-01-01T00:00:00.000000,false
conv_fix,base,2015-01-01T01:00:00.000000,false
conv_fix,base,2015-01-01T02:00:00.000000,false
conv_fix,base,2015-01-01T03:00:00.000000,true