Skip to content

Rung 26: committable processes — rung 25's committable links restated as processes that draw a quarter more than they deliver

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 15865.125 on both sides; structure ✔ 32 constraints · 8 variables, name for name; size ✔ 227 rows · ✔ 95 columns · ✔ 495 nonzeros; duals — integer model, no duals; model for model: 40 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-fix-p-lower 8 8
Generator-fix-p-upper 8 8
Link-fix-p-lower 4 4
Link-fix-p-upper 4 4
Process-com-down-time 8 8
Process-com-ext-p-lower 4 4
Process-com-ext-p-lower-nonneg 4 4
Process-com-ext-p-upper-bigM 4 4
Process-com-ext-p-upper-cap 4 4
Process-com-mod-p-lower 8 8
Process-com-mod-p-upper 8 8
Process-com-p-lower 8 8
Process-com-p-upper 8 8
Process-com-transition-shut-down 20 20
Process-com-transition-start-up 20 20
Process-com-up-time 8 8
Process-ext-p_nom-lower 2 2
Process-ext-p_nom-upper 2 2
Process-p-ramp_limit_down 3 3
Process-p-ramp_limit_down-run-bigM 4 4
Process-p-ramp_limit_down-shut-bigM 4 4
Process-p-ramp_limit_up 3 3
Process-p-ramp_limit_up-run-bigM 4 4
Process-p-ramp_limit_up-start-bigM 4 4
Process-p_nom_modularity 1 1
Process-shut_down-p-fixed-upper 16 16
Process-shut_down-p_nom-variable-upper 4 4
Process-start_up-p-fixed-upper 16 16
Process-start_up-p_nom-variable-upper 4 4
Process-status-p-fixed-upper 16 16
Process-status-p_nom-variable-upper 4 4
column PyPSA specsolve
Generator-p 8 8
Link-p 4 4
Process-n_mod 1 1
Process-p 20 20
Process-p_nom 2 2
Process-shut_down 20 20
Process-start_up 20 20
Process-status 20 20

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}\) — generating units, each on one bus
\(\mathcal{L}\) index \(l\) — link with \(\mathrm{Link\_bus0}: \mathcal{L} \to \mathcal{N},\ \mathrm{Link\_output\_link}: \mathcal{O} \to \mathcal{L}\) — controllable connections, each from one bus to the buses it delivers to
\(\mathcal{O}\) index \(o\) — link_output with \(\mathrm{Link\_output\_bus}: \mathcal{O} \to \mathcal{N},\ \mathrm{Link\_output\_link}: \mathcal{O} \to \mathcal{L}\) — a link's output ports, one label per port a link declares. The labels are PyPSA's bus1, bus2, … columns read long, data prep. A link of any number of output ports is then one term in the balance
\(\mathcal{D}\) index \(d\) — load with \(\mathrm{Load\_bus}: \mathcal{D} \to \mathcal{N}\) — demands, each on one bus
\(\mathcal{Y}\) index \(y\) — period with \(\mathrm{snapshot\_period}: \mathcal{T} \to \mathcal{Y}\) — investment periods. It is PyPSA's investment_periods
\(\mathcal{J}\) index \(j\) — process with \(\mathrm{Process\_output\_process}: \mathcal{R} \to \mathcal{J}\) — generalised multi-port converters, each with an internal power that every port draws or delivers at its own rate
\(\mathcal{R}\) index \(r\) — process_output with \(\mathrm{Process\_output\_bus}: \mathcal{R} \to \mathcal{N},\ \mathrm{Process\_output\_process}: \mathcal{R} \to \mathcal{J}\) — a process's ports, one label per port a process declares. The labels are PyPSA's bus0, bus1, …, each with a signed rate, data prep. A process of any number of ports is then one term in the balance
\(\Xi\) index \(\xi\) — scenario — the futures dispatch is chosen in, each with a weight
\(\mathcal{T}\) index \(t\) — snapshot with \(\mathrm{snapshot\_period}: \mathcal{T} \to \mathcal{Y}\) — dispatch periods

Parameters

Symbol Meaning
\(\mathrm{Bus\_attached}\) Bus_attached over \(\mathcal{N} \times \mathcal{T}\) — whether a load, a unit, a port or a branch that is active in the snapshot's period is attached to the bus, data prep. A bus nothing is attached to has no balance row
\(\mathrm{on}\) Generator_active over \(\mathcal{G} \times \mathcal{T}\) — whether a generator is active in a snapshot's period. It is PyPSA's active, from build year and lifetime, data prep
\(\mathrm{act}\) Generator_active_asset over \(\mathcal{G}\) — whether a generator is one of PyPSA's active_assets, by its active flag alone, without build year and lifetime. A unit that is active in no snapshot of the horizon still counts. PyPSA refuses one that differs by scenario (constants.py:54)
\(\mathrm{com}\) Generator_committable over \(\mathcal{G}\) — whether output is gated by an on/off status decision
\(\mathrm{c}\) Generator_marginal_cost over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — cost of one unit of output
\(\mathrm{p}^{\mathrm{curve}}\) Generator_marginal_cost_curve_p over \(\mathcal{B} \times \mathcal{G}\), absent where the data has no row — the output at each breakpoint of a generator's piecewise marginal_cost curve: PyPSA's p_pu breakpoints times p_nom, data prep. A generator with no curve has no rows
\(\mathrm{c}^{(2)}\) Generator_marginal_cost_quadratic over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — cost of the square of one unit of output
\(\overline{\mathrm{p}}\) Generator_p_max_pu over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — most output, per unit of nominal power: an availability profile
\(\underline{\mathrm{p}}\) Generator_p_min_pu over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — least output, per unit of nominal power
\(\mathrm{p}^{\mathrm{nom}}\) Generator_p_nom over \(\mathcal{G} \times \Xi\) — nominal power
\(\mathrm{ext}\) Generator_p_nom_extendable over \(\mathcal{G}\) — whether the nominal power is a decision
\(\mathrm{sgn}\) Generator_sign over \(\mathcal{G}\) — the sign output enters its bus's balance with. It is PyPSA's sign, 1 unless given, -1 for a unit that draws power. PyPSA refuses one that differs by scenario (constants.py:46)
\(\mathrm{on}^{f}\) Link_active over \(\mathcal{L} \times \mathcal{T}\) — whether a link is active in a snapshot's period. It is PyPSA's active, data prep
\(\mathrm{com}^{f}\) Link_committable over \(\mathcal{L}\) — whether flow is gated by an on/off status decision
\(\eta\) Link_efficiency over \(\mathcal{O} \times \Xi \times \mathcal{T}\) — share of the flow that arrives at an output port, PyPSA's efficiency, efficiency2, … read long: negative where that port consumes rather than delivers. Read at the snapshot the flow arrives, so a delayed port delivers at its arrival snapshot's efficiency (constraints.py:1575)
\(\mathrm{c}^{f}\) Link_marginal_cost over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — cost of one unit of flow
\(\mathrm{c}^{f,(2)}\) Link_marginal_cost_quadratic over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — cost of the square of one unit of flow
\(\mathrm{cyc}^{f}\) Link_output_cyclic_delay over \(\mathcal{O}\) — whether a delayed port's flow wraps from the end of its investment period (PyPSA's cyclic_delay, cyclic_delay2, …). Where it does not, the flow still in transit at each period's first snapshots is lost. The flag is the same in every scenario, as the delay is
\(\mathrm{d}^{f}\) Link_output_delay over \(\mathcal{O}\) — snapshots a port's delivery lags its link's flow (PyPSA's delay, delay2, … read long). In data prep you divide it by the snapshot_weightings.generators value and round it up. It is zero for a port that delivers at once. A port has the same delay in every scenario, because PyPSA refuses a delay that differs by scenario (constants.py:55)
\(\overline{\mathrm{f}}\) Link_p_max_pu over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — most flow, per unit of nominal power
\(\underline{\mathrm{f}}\) Link_p_min_pu over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — least flow, per unit of nominal power: negative for a link that carries both ways
\(\mathrm{f}^{\mathrm{nom}}\) Link_p_nom over \(\mathcal{L} \times \Xi\) — nominal power
\(\mathrm{ext}^{f}\) Link_p_nom_extendable over \(\mathcal{L}\) — whether the nominal power is a decision
\(\mathrm{on}^{\mathrm{load}}\) Load_active over \(\mathcal{D}\) — whether a load is active in the network, PyPSA's active. A load has no build year and no lifetime, so the flag is the same in every snapshot. PyPSA refuses one that differs by scenario (constants.py:54)
\(\mathrm{load}\) Load_p_set over \(\mathcal{D} \times \Xi \times \mathcal{T}\) — demand
\(\mathrm{sgn}^{\mathrm{load}}\) Load_sign over \(\mathcal{D}\) — the sign a load's demand enters its bus's balance with. It is PyPSA's sign, -1 unless given, 1 for a load that feeds its bus. PyPSA refuses one that differs by scenario (constants.py:46)
\(\mathrm{on}^{z}\) Process_active over \(\mathcal{J} \times \mathcal{T}\) — whether a process is active in a snapshot's period. It is PyPSA's active, data prep
\(\mathrm{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{M}^{z}\) Process_big_m over \(\mathcal{J} \times \Xi\), absent where the data has no row — the bound a committed extendable process's big-M rows release it by, data prep. It is the build cap p_nom_max times the highest p_max_pu, where the cap is finite and positive. Elsewhere it is committable_big_m times the highest p_max_pu (components.py:1082-1152). Without that keyword, it is ten times the largest of the peak total load and the component's largest finite p_nom and p_nom_max. Where there is none of them, it is 1e6. Below the internal power a solve wants, it caps that internal power
\(\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{rest}^{z}\) Process_down_time_brought_in over \(\mathcal{J} \times \Xi \times \mathcal{T}\) — one while the down time a process brought into the horizon is still running, zero after. It is PyPSA's stop down_time_before snapshots before the first, counted while min_down_time has not passed since (constraints.py:302-323, :677-678), data prep. Under a rolling horizon with linearised unit commitment, it is the fraction of the stop the previous window solved
\(\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{DT}^{z}\) Process_min_down_time over \(\mathcal{J} \times \Xi\) — least snapshots a process stays off once stopped
\(\mathrm{UT}^{z}\) Process_min_up_time over \(\mathcal{J} \times \Xi\) — least snapshots a process stays on once started
\(\mathrm{N}^{z,\mathrm{fix}}\) Process_modules_installed over \(\mathcal{J} \times \Xi\) — how many whole modules a committable build has in place, data prep. It is Process_p_nom / Process_p_nom_mod where a fixed build is modular, and one where it is not. PyPSA refuses a fixed modular build whose nominal power is not a whole number of modules
\(\mathrm{cyc}^{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
\(\mathrm{z}^{0}\) Process_p_init over \(\mathcal{J} \times \Xi\), \(0\) where the data has no row — the internal power a process brought into the horizon, data prep. It is PyPSA's p_init where the process came in running, and zero where it came in off. Under a rolling horizon, it is the internal power the previous window solved. No value means it is unknown, and the process then has no ramp row at the first snapshot
\(\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{nonneg}^{z}\) Process_p_min_pu_nonneg over \(\mathcal{J}\) — true where none of the process's own minimums-per-unit is negative. It is PyPSA's per-unit (p_min_pu >= 0).all() over every snapshot and scenario, data prep
\(\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
\(\mathrm{rd}^{z}\) Process_ramp_limit_down over \(\mathcal{J} \times \Xi \times \mathcal{T}\), absent where the data has no row — most a process may lower its internal power between snapshots, per unit of nominal power. No value means no limit. The value at the later of the two snapshots applies, so the limit may change over time
\(\mathrm{rd}^{z,\mathrm{dn}}\) Process_ramp_limit_shut_down over \(\mathcal{J} \times \Xi\), absent where the data has no row — most internal power in the snapshot before a process stops, per unit of nominal power. No value means no limit
\(\mathrm{ru}^{z,\mathrm{up}}\) Process_ramp_limit_start_up over \(\mathcal{J} \times \Xi\), absent where the data has no row — most internal power in the snapshot a process starts, per unit of nominal power. No value means no limit
\(\mathrm{ru}^{z}\) Process_ramp_limit_up over \(\mathcal{J} \times \Xi \times \mathcal{T}\), absent where the data has no row — most a process may raise its internal power between snapshots, per unit of nominal power. No value means no limit. The value at the later of the two snapshots applies, so the limit may change over time
\(\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{c}^{z,\mathrm{dn}}\) Process_shut_down_cost over \(\mathcal{J} \times \Xi \times \mathcal{T}\) — cost of one stop in this snapshot
\(\mathrm{c}^{z,\mathrm{on}}\) Process_stand_by_cost over \(\mathcal{J} \times \Xi \times \mathcal{T}\) — cost of one snapshot spent on
\(\mathrm{c}^{z,\mathrm{up}}\) Process_start_up_cost over \(\mathcal{J} \times \Xi \times \mathcal{T}\) — cost of one start in this snapshot
\(\mathrm{u}^{z,0}\) Process_status_initial over \(\mathcal{J} \times \Xi\) — one where the process was on before the first snapshot, zero where off. It is PyPSA's up_time_before > 0 for a committable process, and one for a process that is not, whose ramp rows PyPSA starts from on (constraints.py:323), data prep. Under a rolling horizon, it is the status the previous window solved, a fraction where unit commitment is linearised
\(\mathrm{hold}^{z}\) Process_up_time_brought_in over \(\mathcal{J} \times \Xi \times \mathcal{T}\) — one while the up time a process brought into the horizon is still running, zero after. It is PyPSA's start up_time_before snapshots before the first, counted while min_up_time has not passed since (constraints.py:302-323, :677-678), data prep. Under a rolling horizon with linearised unit commitment, it is the fraction of the start the previous window solved
\(\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\_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{Process\_com\_ext}\) Process_com_ext over \(\mathcal{J} \times \mathcal{T}\) — a committable process with an extendable, non-modular build that is active in the snapshot's period. These are PyPSA's com-ext rows, whose status is relaxed against the chosen build
\(\mathrm{Process\_committed}\) Process_committed over \(\mathcal{J} \times \mathcal{T}\) — a committable process that is active in the snapshot's period: every unit-commitment row's set
\(\mathrm{Process\_ramps\_from\_previous}\) Process_ramps_from_previous over \(\mathcal{J} \times \Xi \times \mathcal{T}\) — a snapshot whose ramp uses a previous output. It is any snapshot but its period's first, and the horizon's first where the process comes in off or carries an initial output

Variables

Symbol Meaning
\(C^{\mathrm{curve}}\) Generator_marginal_cost_piecewise over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — Generator-marginal_cost_piecewise — the running cost of a generator that pays along a curve, held above the curve
\(p\) Generator_p over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — Generator-p — output of a generator in a snapshot
\(f\) Link_p over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — Link-p — PyPSA's p0, the flow measured at the Link_bus0 end. A positive value withdraws there and injects at every bus the link's output ports deliver to
\(N^{z}\) Process_n_mod over \(\mathcal{J}\) — Process-n_mod — how many modules of an extendable modular build. A unit that is not active has none
\(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
\(\mathit{dn}^{z}\) Process_shut_down over \(\mathcal{J} \times \Xi \times \mathcal{T}\) — Process-shut_down — how much of a committable process turns off this snapshot, capped as the status is
\(\mathit{up}^{z}\) Process_start_up over \(\mathcal{J} \times \Xi \times \mathcal{T}\) — Process-start_up — how much of a committable process turns on this snapshot, capped as the status is
\(u^{z}\) Process_status over \(\mathcal{J} \times \Xi \times \mathcal{T}\) — Process-status — how much of a committable process is on. It is an integer the rows below cap at one, or at the module count where the build is modular

Definitions

Symbol Meaning
\(\mathit{Bus\_injection}\) Bus_injection over \(\mathcal{N} \times \Xi \times \mathcal{T}\) — what every component puts into a bus, less what it takes out of it. PyPSA writes each term into the balance, and a load on its right-hand side
\(\mathit{Generator\_injection}\) Generator_injection over \(\mathcal{N} \times \Xi \times \mathcal{T}\)
\(\mathit{Generator\_opex}\) Generator_opex over \(\Xi\)
\(\mathit{Generator\_running\_cost}\) Generator_running_cost over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — what a generator's output costs in a snapshot: the value read off its piecewise curve where it has one, and its linear marginal_cost otherwise. A curve replaces the linear cost, as PyPSA drops the unit from that term (optimize.py:333-348)
\(\mathit{Link\_injection}\) Link_injection over \(\mathcal{N} \times \Xi \times \mathcal{T}\)
\(\mathit{Link\_opex}\) Link_opex over \(\Xi\)
\(\mathit{Link\_output\_arrival}\) Link_output_arrival over \(\mathcal{O} \times \Xi \times \mathcal{T}\) — what a link delivers to an output port at a snapshot. It is its flow delayed by the port's delay within its investment period. It is multiplied by the port's efficiency at the snapshot the flow arrives. Where the port is cyclic_delay, the delayed flow wraps from the period's end. Where it is not, the flow still in transit at the period's first snapshots is lost. A port that does not delay (delay zero) delivers its flow unshifted, cyclic or not
\(\mathrm{Load\_demand}\) Load_demand over \(\mathcal{D} \times \Xi \times \mathcal{T}\) — what a load draws from its bus's balance. It is its demand times its sign where it is active, and nothing where it is not. PyPSA drops an inactive load from the balance (constraints.py:1591-1592)
\(\mathrm{Load\_injection}\) Load_injection over \(\mathcal{N} \times \Xi \times \mathcal{T}\)
\(\mathit{Process\_capex}\) Process_capex (scalar)
\(\mathit{Process\_commitment\_opex}\) Process_commitment_opex over \(\Xi\)
\(\mathit{Process\_injection}\) Process_injection over \(\mathcal{N} \times \Xi \times \mathcal{T}\)
\(\mathit{Process\_modules}\) Process_modules over \(\mathcal{J} \times \Xi\) — how many modules a committed process's status counts: the chosen number where the build is extendable and modular, and the modules installed otherwise (constraints.py:656-661)
\(\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{Process\_p\_carried\_over}\) Process_p_carried_over over \(\mathcal{J} \times \Xi \times \mathcal{T}\) — the output a process carries over into a snapshot. At the first, it is the p_init it brought in, which is zero where it came in off. After that, it is the previous snapshot's
\(\mathrm{Process\_p\_nom\_committed}\) Process_p_nom_committed over \(\mathcal{J} \times \Xi\) — the build a committed process's ramp rows are taken against: one module where the build is modular, since its status counts modules, and the given build otherwise (constraints.py:1131-1134)
\(\mathit{Process\_p\_nom\_effective}\) Process_p_nom_effective over \(\mathcal{J} \times \Xi\) — the build a process's limits are taken against: the chosen one where it is extendable, the given one otherwise
\(\mathit{Process\_previous\_p}\) Process_previous_p over \(\mathcal{J} \times \Xi \times \mathcal{T}\) — the output a process carries into a snapshot. It is nothing at the first snapshot it is active in past the first of the horizon: PyPSA fills an output it did not build with zero (constraints.py:716). It is the output carried over otherwise
\(\mathit{Process\_previous\_status}\) Process_previous_status over \(\mathcal{J} \times \Xi \times \mathcal{T}\) — the commitment state a process carries into a snapshot. It is off at the first snapshot it is active in past the first of the horizon. PyPSA reads a status it did not build as off there (constraints.py:391). It is the state carried over otherwise
\(\mathit{Process\_ramp\_down\_allowance}\) Process_ramp_down_allowance over \(\mathcal{J} \times \Xi \times \mathcal{T}\) — how far a process may lower internal power between two snapshots. It is its ramp limit of the build while it stays on, plus its shut-down ramp in the snapshot it turns off
\(\mathrm{Process\_ramp\_down\_rate}\) Process_ramp_down_rate over \(\mathcal{J} \times \Xi \times \mathcal{T}\) — the ramp limit in a process's down row, PyPSA's ramp_limit_down. It is the full build where PyPSA has none, since a shut-down ramp alone builds the row
\(\mathit{Process\_ramp\_previous\_status}\) Process_ramp_previous_status over \(\mathcal{J} \times \Xi \times \mathcal{T}\) — the status a committed process's ramp rows carry into a snapshot. At the first snapshot, a fixed modular process that came in running has every module on, since the state it brought in is on or off (constraints.py:1152-1157). The transition and down-time rows count it as one module (PyPSA/PyPSA#2114). It is the state carried in otherwise
\(\mathit{Process\_ramp\_up\_allowance}\) Process_ramp_up_allowance over \(\mathcal{J} \times \Xi \times \mathcal{T}\) — how far a process may raise internal power between two snapshots. It is its ramp limit of the build while it stays on, plus its start-up ramp in the snapshot it turns on
\(\mathrm{Process\_ramp\_up\_rate}\) Process_ramp_up_rate over \(\mathcal{J} \times \Xi \times \mathcal{T}\) — the ramp limit in a process's up row, PyPSA's ramp_limit_up. It is the full build where PyPSA has none, since a start-up ramp alone builds the row
\(\mathrm{Process\_shut\_down\_rate}\) Process_shut_down_rate over \(\mathcal{J} \times \Xi\) — the shut-down ramp in a process's down row (PyPSA's ramp_limit_shut_down), or the full build where it has none
\(\mathrm{Process\_start\_up\_rate}\) Process_start_up_rate over \(\mathcal{J} \times \Xi\) — the start-up ramp in a process's up row (PyPSA's ramp_limit_start_up), or the full build where it has none
\(\mathit{Process\_status\_carried\_over}\) Process_status_carried_over over \(\mathcal{J} \times \Xi \times \mathcal{T}\) — the state a process carries over into a snapshot: the state it brought into the horizon at the first, the previous snapshot's after that
\(\mathit{risk\_weighted\_opex}\) risk_weighted_opex (scalar)
\(\mathit{scenario\_opex}\) scenario_opex over \(\Xi\) — what a future costs to run: every operating term, weighted by the snapshot's hours and its period, before the scenario's own weight. A start and a stop cost what they cost, unweighted, as PyPSA adds them (optimize.py:448-468)
\(\mathit{total\_cost}\) total_cost (scalar) — what the system costs. Capacity counts once per active period at its expected cost over the scenarios. Operation counts in expectation over the scenarios, and a share of it at the tail

Notation

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

Conditions

Generator_marginal_cost_curve

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

Process_com_ext

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

Process_committed

\[ \mathrm{Process\_committed}_{j,t} \iff \mathrm{com}^{z}_{j} \wedge \mathrm{on}^{z}_{j,t} \qquad \forall\, j \in \mathcal{J},\ t \in \mathcal{T} \]

Process_ramps_from_previous

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

Variable domains

Generator_marginal_cost_piecewise

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

Generator_p

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

Link_p

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

Process_n_mod

\[ N^{z}_{j} \ge 0, N^{z}_{j} \in \mathbb{Z} \qquad \forall\, j \in \mathcal{J} \,:\, \mathrm{ext}^{z}_{j} \wedge \mathrm{z}^{\mathrm{mod}}_{j} > 0 \wedge \mathrm{act}^{z}_{j} \]

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

Process_shut_down

\[ \mathit{dn}^{z}_{j,\xi,t} \ge 0, \mathit{dn}^{z}_{j,\xi,t} \in \mathbb{Z} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Process\_committed}_{j,t} \]

Process_start_up

\[ \mathit{up}^{z}_{j,\xi,t} \ge 0, \mathit{up}^{z}_{j,\xi,t} \in \mathbb{Z} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Process\_committed}_{j,t} \]

Process_status

\[ u^{z}_{j,\xi,t} \ge 0, u^{z}_{j,\xi,t} \in \mathbb{Z} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Process\_committed}_{j,t} \]

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_injection

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

Generator_opex

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

Generator_running_cost

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

Link_injection

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

Link_opex

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

Link_output_arrival

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

Load_demand

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

Load_injection

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

Process_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_commitment_opex

\[ \mathit{Process\_commitment\_opex}_{\xi} = \sum_{t \in \mathcal{T}} \sum_{j \in \mathcal{J}} u^{z}_{j,\xi,t} \cdot \mathrm{c}^{z,\mathrm{on}}_{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}} \mathit{up}^{z}_{j,\xi,t} \cdot \mathrm{c}^{z,\mathrm{up}}_{j,\xi,t} \cdot \mathrm{w}^{y}_{\mathrm{snapshot\_period}(t)} + \sum_{t \in \mathcal{T}} \sum_{j \in \mathcal{J}} \mathit{dn}^{z}_{j,\xi,t} \cdot \mathrm{c}^{z,\mathrm{dn}}_{j,\xi,t} \cdot \mathrm{w}^{y}_{\mathrm{snapshot\_period}(t)} \qquad \forall\, \xi \in \Xi \]

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_modules

\[ \mathit{Process\_modules}_{j,\xi} = \begin{cases} N^{z}_{j} & \text{if } \mathrm{ext}^{z}_{j} \wedge \mathrm{z}^{\mathrm{mod}}_{j} > 0 \\ \mathrm{N}^{z,\mathrm{fix}}_{j,\xi} & \text{otherwise} \end{cases} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi \]

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

Process_p_carried_over

\[ \mathit{Process\_p\_carried\_over}_{j,\xi,t} = \begin{cases} \mathrm{z}^{0}_{j,\xi} & \text{if } \mathrm{pos}(t) = 0 \\ z_{j,\xi,t - 1} & \text{otherwise} \end{cases} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \]

Process_p_nom_committed

\[ \mathrm{Process\_p\_nom\_committed}_{j,\xi} = \begin{cases} \mathrm{z}^{\mathrm{mod}}_{j} & \text{if } \mathrm{z}^{\mathrm{mod}}_{j} > 0 \\ \mathrm{z}^{\mathrm{nom}}_{j,\xi} & \text{otherwise} \end{cases} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi \]

Process_p_nom_effective

\[ \mathit{Process\_p\_nom\_effective}_{j,\xi} = \begin{cases} Z_{j} & \text{if } \mathrm{ext}^{z}_{j} \\ \mathrm{z}^{\mathrm{nom}}_{j,\xi} & \text{otherwise} \end{cases} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi \]

Process_previous_p

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

Process_previous_status

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

Process_ramp_down_allowance

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

Process_ramp_down_rate

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

Process_ramp_previous_status

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

Process_ramp_up_allowance

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

Process_ramp_up_rate

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

Process_shut_down_rate

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

Process_start_up_rate

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

Process_status_carried_over

\[ \mathit{Process\_status\_carried\_over}_{j,\xi,t} = \begin{cases} \mathrm{u}^{z,0}_{j,\xi} & \text{if } \mathrm{pos}(t) = 0 \\ u^{z}_{j,\xi,t - 1} & \text{otherwise} \end{cases} \qquad \forall\, j \in \mathcal{J},\ \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} + \mathit{Process\_commitment\_opex}_{\xi} \qquad \forall\, \xi \in \Xi \]

total_cost

\[ \mathit{total\_cost} = \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_fix_p_lower

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

Generator_fix_p_upper

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

Link_fix_p_lower

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

Link_fix_p_upper

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

Process_com_down_time

\[ \sum_{t' \in \mathcal{T} \,:\, 0 \le t - t' < \mathrm{DT}^{z}} \mathit{dn}^{z}_{j,\xi,t'} + \mathrm{rest}^{z}_{j,\xi,t} \le \mathit{Process\_modules}_{j,\xi} - u^{z}_{j,\xi,t} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Process\_committed}_{j,t} \wedge \mathrm{DT}^{z}_{j,\xi} > 0 \]

Process_com_ext_p_lower

\[ z_{j,\xi,t} \ge \underline{\mathrm{z}}_{j,\xi,t} \cdot Z_{j} + \mathrm{M}^{z}_{j,\xi} \cdot u^{z}_{j,\xi,t} - \mathrm{M}^{z}_{j,\xi} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Process\_com\_ext}_{j,t} \]

Process_com_ext_p_lower_nonneg

\[ z_{j,\xi,t} \ge 0 \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Process\_com\_ext}_{j,t} \wedge \mathrm{nonneg}^{z}_{j} \]

Process_com_ext_p_upper_big_m

\[ z_{j,\xi,t} \le \mathrm{M}^{z}_{j,\xi} \cdot u^{z}_{j,\xi,t} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Process\_com\_ext}_{j,t} \]

Process_com_ext_p_upper_cap

\[ z_{j,\xi,t} \le \overline{\mathrm{z}}_{j,\xi,t} \cdot Z_{j} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Process\_com\_ext}_{j,t} \]

Process_com_mod_p_lower

\[ z_{j,\xi,t} \ge \underline{\mathrm{z}}_{j,\xi,t} \cdot \mathrm{z}^{\mathrm{mod}}_{j} \cdot u^{z}_{j,\xi,t} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Process\_committed}_{j,t} \wedge \mathrm{z}^{\mathrm{mod}}_{j} > 0 \]

Process_com_mod_p_upper

\[ z_{j,\xi,t} \le \overline{\mathrm{z}}_{j,\xi,t} \cdot \mathrm{z}^{\mathrm{mod}}_{j} \cdot u^{z}_{j,\xi,t} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Process\_committed}_{j,t} \wedge \mathrm{z}^{\mathrm{mod}}_{j} > 0 \]

Process_com_p_lower

\[ z_{j,\xi,t} \ge \underline{\mathrm{z}}_{j,\xi,t} \cdot \mathrm{z}^{\mathrm{nom}}_{j,\xi} \cdot u^{z}_{j,\xi,t} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Process\_committed}_{j,t} \wedge \neg \mathrm{ext}^{z}_{j} \wedge \neg \left( \mathrm{z}^{\mathrm{mod}}_{j} > 0 \right) \]

Process_com_p_upper

\[ z_{j,\xi,t} \le \overline{\mathrm{z}}_{j,\xi,t} \cdot \mathrm{z}^{\mathrm{nom}}_{j,\xi} \cdot u^{z}_{j,\xi,t} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Process\_committed}_{j,t} \wedge \neg \mathrm{ext}^{z}_{j} \wedge \neg \left( \mathrm{z}^{\mathrm{mod}}_{j} > 0 \right) \]

Process_com_transition_shut_down

\[ \mathit{dn}^{z}_{j,\xi,t} \ge \mathit{Process\_previous\_status}_{j,\xi,t} - u^{z}_{j,\xi,t} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Process\_committed}_{j,t} \]

Process_com_transition_start_up

\[ \mathit{up}^{z}_{j,\xi,t} \ge u^{z}_{j,\xi,t} - \mathit{Process\_previous\_status}_{j,\xi,t} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Process\_committed}_{j,t} \]

Process_com_up_time

\[ \sum_{t' \in \mathcal{T} \,:\, 0 \le t - t' < \mathrm{UT}^{z}} \mathit{up}^{z}_{j,\xi,t'} + \mathrm{hold}^{z}_{j,\xi,t} \le u^{z}_{j,\xi,t} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Process\_committed}_{j,t} \wedge \mathrm{UT}^{z}_{j,\xi} > 0 \]

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_p_nom_modularity

\[ Z_{j} = \mathrm{z}^{\mathrm{mod}}_{j} \cdot N^{z}_{j} \qquad \forall\, j \in \mathcal{J} \,:\, \mathrm{ext}^{z}_{j} \wedge \mathrm{z}^{\mathrm{mod}}_{j} > 0 \wedge \mathrm{act}^{z}_{j} \]

Process_p_ramp_limit_down

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

Process_p_ramp_limit_down_run_big_m

\[ z_{j,\xi,t} - \mathit{Process\_previous\_p}_{j,\xi,t} \ge -\mathrm{Process\_ramp\_down\_rate}_{j,\xi,t} \cdot Z_{j} - \mathrm{M}^{z}_{j,\xi} + \mathrm{M}^{z}_{j,\xi} \cdot u^{z}_{j,\xi,t} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Process\_com\_ext}_{j,t} \wedge \left( \mathrm{rd}^{z}_{j,\xi,t} \text{ is defined} \vee \mathrm{rd}^{z,\mathrm{dn}}_{j,\xi} \text{ is defined} \right) \wedge \mathrm{Process\_ramps\_from\_previous}_{j,\xi,t} \]

Process_p_ramp_limit_down_shut_big_m

\[ \mathit{Process\_previous\_p}_{j,\xi,t} - z_{j,\xi,t} \le \mathrm{Process\_shut\_down\_rate}_{j,\xi} \cdot Z_{j} + \mathrm{M}^{z}_{j,\xi} - \mathrm{M}^{z}_{j,\xi} \cdot \mathit{dn}^{z}_{j,\xi,t} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Process\_com\_ext}_{j,t} \wedge \left( \mathrm{rd}^{z}_{j,\xi,t} \text{ is defined} \vee \mathrm{rd}^{z,\mathrm{dn}}_{j,\xi} \text{ is defined} \right) \wedge \mathrm{Process\_ramps\_from\_previous}_{j,\xi,t} \]

Process_p_ramp_limit_up

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

Process_p_ramp_limit_up_run_big_m

\[ z_{j,\xi,t} - \mathit{Process\_previous\_p}_{j,\xi,t} \le \mathrm{Process\_ramp\_up\_rate}_{j,\xi,t} \cdot Z_{j} + \mathrm{M}^{z}_{j,\xi} - \mathrm{M}^{z}_{j,\xi} \cdot \mathit{Process\_previous\_status}_{j,\xi,t} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Process\_com\_ext}_{j,t} \wedge \left( \mathrm{ru}^{z}_{j,\xi,t} \text{ is defined} \vee \mathrm{ru}^{z,\mathrm{up}}_{j,\xi} \text{ is defined} \right) \wedge \mathrm{Process\_ramps\_from\_previous}_{j,\xi,t} \]

Process_p_ramp_limit_up_start_big_m

\[ z_{j,\xi,t} - \mathit{Process\_previous\_p}_{j,\xi,t} \le \mathrm{Process\_start\_up\_rate}_{j,\xi} \cdot Z_{j} + \mathrm{M}^{z}_{j,\xi} - \mathrm{M}^{z}_{j,\xi} \cdot \mathit{up}^{z}_{j,\xi,t} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Process\_com\_ext}_{j,t} \wedge \left( \mathrm{ru}^{z}_{j,\xi,t} \text{ is defined} \vee \mathrm{ru}^{z,\mathrm{up}}_{j,\xi} \text{ is defined} \right) \wedge \mathrm{Process\_ramps\_from\_previous}_{j,\xi,t} \]

Process_shut_down_p_fixed_upper

\[ \mathit{dn}^{z}_{j,\xi,t} \le \mathrm{N}^{z,\mathrm{fix}}_{j,\xi} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Process\_committed}_{j,t} \wedge \neg \left( \mathrm{ext}^{z}_{j} \wedge \mathrm{z}^{\mathrm{mod}}_{j} > 0 \right) \]

Process_shut_down_p_nom_variable_upper

\[ \mathit{dn}^{z}_{j,\xi,t} \le N^{z}_{j} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Process\_committed}_{j,t} \wedge \mathrm{ext}^{z}_{j} \wedge \mathrm{z}^{\mathrm{mod}}_{j} > 0 \]

Process_start_up_p_fixed_upper

\[ \mathit{up}^{z}_{j,\xi,t} \le \mathrm{N}^{z,\mathrm{fix}}_{j,\xi} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Process\_committed}_{j,t} \wedge \neg \left( \mathrm{ext}^{z}_{j} \wedge \mathrm{z}^{\mathrm{mod}}_{j} > 0 \right) \]

Process_start_up_p_nom_variable_upper

\[ \mathit{up}^{z}_{j,\xi,t} \le N^{z}_{j} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Process\_committed}_{j,t} \wedge \mathrm{ext}^{z}_{j} \wedge \mathrm{z}^{\mathrm{mod}}_{j} > 0 \]

Process_status_p_fixed_upper

\[ u^{z}_{j,\xi,t} \le \mathrm{N}^{z,\mathrm{fix}}_{j,\xi} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Process\_committed}_{j,t} \wedge \neg \left( \mathrm{ext}^{z}_{j} \wedge \mathrm{z}^{\mathrm{mod}}_{j} > 0 \right) \]

Process_status_p_nom_variable_upper

\[ u^{z}_{j,\xi,t} \le N^{z}_{j} \qquad \forall\, j \in \mathcal{J},\ \xi \in \Xi,\ t \in \mathcal{T} \,:\, \mathrm{Process\_committed}_{j,t} \wedge \mathrm{ext}^{z}_{j} \wedge \mathrm{z}^{\mathrm{mod}}_{j} > 0 \]

The spec, differential/pypsa/rungs/rung_26_committable_process.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}
  Link_bus0: {key: link, values: bus, description: the bus a link leaves}
  Link_output_bus: {key: link_output, values: bus, description: 'the bus an output port delivers to. It
      is PyPSA''s `bus1`, `bus2`, … columns. A link of three output ports is three labels here rather
      than a third relation, so the file states any number of them'}
  Link_output_link: {key: link_output, values: link, description: the link an output port belongs to}
  Load_bus: {key: load, values: bus, description: the bus a load sits on}
  Process_output_bus: {key: process_output, values: bus, description: 'the bus a port draws from or delivers
      to. It is PyPSA''s `bus0`, `bus1`, … columns. A process of three ports is three labels here rather
      than a third relation, so the file states any number of them'}
  Process_output_process: {key: process_output, values: process, description: the process a port belongs
      to}
  snapshot_period: {key: snapshot, values: period, description: the investment period a snapshot falls
      in}
parameters:
  Bus_attached:
    dims: [bus, snapshot]
    dtype: bool
    description: whether a load, a unit, a port or a branch that is active in the snapshot's period is
      attached to the bus, data prep. A bus nothing is attached to has no balance row
  Generator_active:
    dims: [generator, snapshot]
    dtype: bool
    description: whether a generator is active in a snapshot's period. It is PyPSA's `active`, from build
      year and lifetime, data prep
  Generator_active_asset:
    dims: [generator]
    dtype: bool
    description: whether a generator is one of PyPSA's `active_assets`, by its `active` flag alone, without
      build year and lifetime. A unit that is active in no snapshot of the horizon still counts. PyPSA
      refuses one that differs by scenario (`constants.py:54`)
  Generator_committable:
    dims: [generator]
    dtype: bool
    description: whether output is gated by an on/off status decision
  Generator_marginal_cost:
    dims: [generator, scenario, snapshot]
    description: cost of one unit of output
  Generator_marginal_cost_curve_p:
    dims: [breakpoint, generator]
    missing: absent
    description: 'the output at each breakpoint of a generator''s piecewise `marginal_cost` curve: PyPSA''s
      `p_pu` breakpoints times `p_nom`, data prep. A generator with no curve has no rows'
  Generator_marginal_cost_quadratic:
    dims: [generator, scenario, snapshot]
    description: cost of the square of one unit of output
  Generator_p_max_pu:
    dims: [generator, scenario, snapshot]
    description: 'most output, per unit of nominal power: an availability profile'
  Generator_p_min_pu:
    dims: [generator, scenario, snapshot]
    description: least output, per unit of nominal power
  Generator_p_nom:
    dims: [generator, scenario]
    description: nominal power
  Generator_p_nom_extendable:
    dims: [generator]
    dtype: bool
    description: whether the nominal power is a decision
  Generator_sign:
    dims: [generator]
    description: the sign output enters its bus's balance with. It is PyPSA's `sign`, `1` unless given,
      `-1` for a unit that draws power. PyPSA refuses one that differs by scenario (`constants.py:46`)
  Link_active:
    dims: [link, snapshot]
    dtype: bool
    description: whether a link is active in a snapshot's period. It is PyPSA's `active`, data prep
  Link_committable:
    dims: [link]
    dtype: bool
    description: whether flow is gated by an on/off status decision
  Link_efficiency:
    dims: [link_output, scenario, snapshot]
    description: 'share of the flow that arrives at an output port, PyPSA''s `efficiency`, `efficiency2`,
      … read long: negative where that port consumes rather than delivers. Read at the snapshot the flow
      arrives, so a delayed port delivers at its arrival snapshot''s efficiency (`constraints.py:1575`)'
  Link_marginal_cost:
    dims: [link, scenario, snapshot]
    description: cost of one unit of flow
  Link_marginal_cost_quadratic:
    dims: [link, scenario, snapshot]
    description: cost of the square of one unit of flow
  Link_output_cyclic_delay:
    dims: [link_output]
    dtype: bool
    description: whether a delayed port's flow wraps from the end of its investment period (PyPSA's `cyclic_delay`,
      `cyclic_delay2`, …). Where it does not, the flow still in transit at each period's first snapshots
      is lost. The flag is the same in every scenario, as the delay is
  Link_output_delay:
    dims: [link_output]
    dtype: int
    description: snapshots a port's delivery lags its link's flow (PyPSA's `delay`, `delay2`, … read long).
      In data prep you divide it by the `snapshot_weightings.generators` value and round it up. It is
      zero for a port that delivers at once. A port has the same delay in every scenario, because PyPSA
      refuses a delay that differs by scenario (`constants.py:55`)
  Link_p_max_pu:
    dims: [link, scenario, snapshot]
    description: most flow, per unit of nominal power
  Link_p_min_pu:
    dims: [link, scenario, snapshot]
    description: 'least flow, per unit of nominal power: negative for a link that carries both ways'
  Link_p_nom:
    dims: [link, scenario]
    description: nominal power
  Link_p_nom_extendable:
    dims: [link]
    dtype: bool
    description: whether the nominal power is a decision
  Load_active:
    dims: [load]
    dtype: bool
    description: whether a load is active in the network, PyPSA's `active`. A load has no build year and
      no lifetime, so the flag is the same in every snapshot. PyPSA refuses one that differs by scenario
      (`constants.py:54`)
  Load_p_set:
    dims: [load, scenario, snapshot]
    description: demand
  Load_sign:
    dims: [load]
    description: the sign a load's demand enters its bus's balance with. It is PyPSA's `sign`, `-1` unless
      given, `1` for a load that feeds its bus. PyPSA refuses one that differs by scenario (`constants.py:46`)
  Process_active:
    dims: [process, snapshot]
    dtype: bool
    description: whether a process is active in a snapshot's period. It is PyPSA's `active`, data prep
  Process_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_big_m:
    dims: [process, scenario]
    missing: absent
    description: the bound a committed extendable process's big-M rows release it by, data prep. It is
      the build cap `p_nom_max` times the highest `p_max_pu`, where the cap is finite and positive. Elsewhere
      it is `committable_big_m` times the highest `p_max_pu` (`components.py:1082-1152`). Without that
      keyword, it is ten times the largest of the peak total load and the component's largest finite `p_nom`
      and `p_nom_max`. Where there is none of them, it is 1e6. Below the internal power a solve wants,
      it caps that internal power
  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_down_time_brought_in:
    dims: [process, scenario, snapshot]
    description: one while the down time a process brought into the horizon is still running, zero after.
      It is PyPSA's stop `down_time_before` snapshots before the first, counted while `min_down_time`
      has not passed since (`constraints.py:302-323`, `:677-678`), data prep. Under a rolling horizon
      with linearised unit commitment, it is the fraction of the stop the previous window solved
  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_min_down_time:
    dims: [process, scenario]
    dtype: int
    description: least snapshots a process stays off once stopped
  Process_min_up_time:
    dims: [process, scenario]
    dtype: int
    description: least snapshots a process stays on once started
  Process_modules_installed:
    dims: [process, scenario]
    description: how many whole modules a committable build has in place, data prep. It is `Process_p_nom
      / Process_p_nom_mod` where a fixed build is modular, and one where it is not. PyPSA refuses a fixed
      modular build whose nominal power is not a whole number of modules
  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_init:
    dims: [process, scenario]
    missing: 0.0
    description: the internal power a process brought into the horizon, data prep. It is PyPSA's `p_init`
      where the process came in running, and zero where it came in off. Under a rolling horizon, it is
      the internal power the previous window solved. No value means it is unknown, and the process then
      has no ramp row at the first snapshot
  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_min_pu_nonneg:
    dims: [process]
    dtype: bool
    description: true where none of the process's own minimums-per-unit is negative. It is PyPSA's per-unit
      `(p_min_pu >= 0).all()` over every snapshot and scenario, data prep
  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_ramp_limit_down:
    dims: [process, scenario, snapshot]
    missing: absent
    description: most a process may lower its internal power between snapshots, per unit of nominal power.
      No value means no limit. The value at the later of the two snapshots applies, so the limit may change
      over time
  Process_ramp_limit_shut_down:
    dims: [process, scenario]
    missing: absent
    description: most internal power in the snapshot before a process stops, per unit of nominal power.
      No value means no limit
  Process_ramp_limit_start_up:
    dims: [process, scenario]
    missing: absent
    description: most internal power in the snapshot a process starts, per unit of nominal power. No value
      means no limit
  Process_ramp_limit_up:
    dims: [process, scenario, snapshot]
    missing: absent
    description: most a process may raise its internal power between snapshots, per unit of nominal power.
      No value means no limit. The value at the later of the two snapshots applies, so the limit may change
      over time
  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`)
  Process_shut_down_cost:
    dims: [process, scenario, snapshot]
    description: cost of one stop in this snapshot
  Process_stand_by_cost:
    dims: [process, scenario, snapshot]
    description: cost of one snapshot spent on
  Process_start_up_cost:
    dims: [process, scenario, snapshot]
    description: cost of one start in this snapshot
  Process_status_initial:
    dims: [process, scenario]
    description: one where the process was on before the first snapshot, zero where off. It is PyPSA's
      `up_time_before > 0` for a committable process, and one for a process that is not, whose ramp rows
      PyPSA starts from on (`constraints.py:323`), data prep. Under a rolling horizon, it is the status
      the previous window solved, a fraction where unit commitment is linearised
  Process_up_time_brought_in:
    dims: [process, scenario, snapshot]
    description: one while the up time a process brought into the horizon is still running, zero after.
      It is PyPSA's start `up_time_before` snapshots before the first, counted while `min_up_time` has
      not passed since (`constraints.py:302-323`, `:677-678`), data prep. Under a rolling horizon with
      linearised unit commitment, it is the fraction of the start the previous window solved
  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_p:
    dims: [generator, scenario, snapshot]
    where: Generator_active
    description: '`Generator-p` — output of a generator in a snapshot'
  Link_p:
    dims: [link, scenario, snapshot]
    where: Link_active
    description: '`Link-p` — PyPSA''s `p0`, the flow measured at the `Link_bus0` end. A positive value
      withdraws there and injects at every bus the link''s output ports deliver to'
  Process_n_mod:
    dims: [process]
    where: Process_p_nom_extendable AND Process_p_nom_mod > 0 AND Process_active_asset
    bounds: {lower: 0.0}
    domain: integer
    description: '`Process-n_mod` — how many modules of an extendable modular build. A unit that is not
      active has none'
  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'
  Process_shut_down:
    dims: [process, scenario, snapshot]
    where: Process_committed
    bounds: {lower: 0.0}
    domain: integer
    description: '`Process-shut_down` — how much of a committable process turns off this snapshot, capped
      as the status is'
  Process_start_up:
    dims: [process, scenario, snapshot]
    where: Process_committed
    bounds: {lower: 0.0}
    domain: integer
    description: '`Process-start_up` — how much of a committable process turns on this snapshot, capped
      as the status is'
  Process_status:
    dims: [process, scenario, snapshot]
    where: Process_committed
    bounds: {lower: 0.0}
    domain: integer
    description: '`Process-status` — how much of a committable process is on. It is an integer the rows
      below cap at one, or at the module count where the build is modular'
  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_fix_p_lower:
    dims: [generator, scenario, snapshot]
    where: not Generator_p_nom_extendable AND not Generator_committable AND Generator_active
    expression: Generator_p >= Generator_p_min_pu * Generator_p_nom
    description: '`Generator-fix-p-lower` — a fixed generator outputs at least its minimum'
  Generator_fix_p_upper:
    dims: [generator, scenario, snapshot]
    where: not Generator_p_nom_extendable AND not Generator_committable AND Generator_active
    expression: Generator_p <= Generator_p_max_pu * Generator_p_nom
    description: '`Generator-fix-p-upper` — a fixed generator outputs at most what is available'
  Link_fix_p_lower:
    dims: [link, scenario, snapshot]
    where: not Link_p_nom_extendable AND not Link_committable AND Link_active
    expression: Link_p >= Link_p_min_pu * Link_p_nom
    description: '`Link-fix-p-lower` — a fixed link carries at least its minimum, negative for the other
      way'
  Link_fix_p_upper:
    dims: [link, scenario, snapshot]
    where: not Link_p_nom_extendable AND not Link_committable AND Link_active
    expression: Link_p <= Link_p_max_pu * Link_p_nom
    description: '`Link-fix-p-upper` — a fixed link carries at most its nominal power'
  Process_com_down_time:
    dims: [process, scenario, snapshot]
    where: Process_committed AND Process_min_down_time > 0
    expression: sum_back(Process_shut_down, along=snapshot, window=Process_min_down_time) + Process_down_time_brought_in
      <= Process_modules - Process_status
    description: '`Process-com-down-time` — a process stopped within its own minimum down time is still
      off, and so are the modules of a modular process that stopped. The down time it brought into the
      horizon counts as one stop before the first snapshot, also where the process is modular and all
      its modules stopped (`constraints.py:656-683`, PyPSA/PyPSA#2114)'
  Process_com_ext_p_lower:
    dims: [process, scenario, snapshot]
    where: Process_com_ext
    expression: Process_p >= ((Process_p_min_pu * Process_p_nom_ext) + (Process_big_m * Process_status))
      - Process_big_m
    description: '`Process-com-ext-p-lower` — a committed extendable process runs at least its minimum
      of the chosen build. Off, the big M releases the row'
  Process_com_ext_p_lower_nonneg:
    dims: [process, scenario, snapshot]
    where: Process_com_ext AND Process_p_min_pu_nonneg
    expression: Process_p >= 0
    description: '`Process-com-ext-p-lower-nonneg` — where no minimum-per-unit is negative, internal power
      is also plainly non-negative, a row the big-M lower cannot assert while the process is off'
  Process_com_ext_p_upper_big_m:
    dims: [process, scenario, snapshot]
    where: Process_com_ext
    expression: Process_p <= Process_big_m * Process_status
    description: '`Process-com-ext-p-upper-bigM` — off, a process does not run. On, the big M is no bound'
  Process_com_ext_p_upper_cap:
    dims: [process, scenario, snapshot]
    where: Process_com_ext
    expression: Process_p <= Process_p_max_pu * Process_p_nom_ext
    description: '`Process-com-ext-p-upper-cap` — a committed extendable process runs at most what is
      available of the chosen build, whatever its status'
  Process_com_mod_p_lower:
    dims: [process, scenario, snapshot]
    where: Process_committed AND Process_p_nom_mod > 0
    expression: Process_p >= (Process_p_min_pu * Process_p_nom_mod) * Process_status
    description: '`Process-com-mod-p-lower` — a committed modular process runs at least its minimum of
      one module, whether the build is fixed or a decision'
  Process_com_mod_p_upper:
    dims: [process, scenario, snapshot]
    where: Process_committed AND Process_p_nom_mod > 0
    expression: Process_p <= (Process_p_max_pu * Process_p_nom_mod) * Process_status
    description: '`Process-com-mod-p-upper` — a committed modular process runs at most one module''s share,
      whether the build is fixed or a decision'
  Process_com_p_lower:
    dims: [process, scenario, snapshot]
    where: Process_committed AND NOT Process_p_nom_extendable AND NOT (Process_p_nom_mod > 0)
    expression: Process_p >= (Process_p_min_pu * Process_p_nom) * Process_status
    description: '`Process-com-p-lower` — a committed process runs at least its minimum. Off, it runs
      at least nothing'
  Process_com_p_upper:
    dims: [process, scenario, snapshot]
    where: Process_committed AND NOT Process_p_nom_extendable AND NOT (Process_p_nom_mod > 0)
    expression: Process_p <= (Process_p_max_pu * Process_p_nom) * Process_status
    description: '`Process-com-p-upper` — a committed process runs at most what is available. Off, it
      runs at most nothing'
  Process_com_transition_shut_down:
    dims: [process, scenario, snapshot]
    where: Process_committed
    expression: Process_shut_down >= Process_previous_status - Process_status
    description: '`Process-com-transition-shut-down` — turning off is a stop, counted against the state
      the process carried into the snapshot'
  Process_com_transition_start_up:
    dims: [process, scenario, snapshot]
    where: Process_committed
    expression: Process_start_up >= Process_status - Process_previous_status
    description: '`Process-com-transition-start-up` — turning on is a start, counted against the state
      the process carried into the snapshot'
  Process_com_up_time:
    dims: [process, scenario, snapshot]
    where: Process_committed AND Process_min_up_time > 0
    expression: sum_back(Process_start_up, along=snapshot, window=Process_min_up_time) + Process_up_time_brought_in
      <= Process_status
    description: '`Process-com-up-time` — a process started within its own minimum up time is still on.
      The up time it brought into the horizon counts as a start before the first snapshot'
  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_p_nom_modularity:
    dims: [process]
    where: Process_p_nom_extendable AND Process_p_nom_mod > 0 AND Process_active_asset
    expression: Process_p_nom_ext == Process_p_nom_mod * Process_n_mod
    description: '`Process-p_nom_modularity` — the chosen build is a whole number of modules'
  Process_p_ramp_limit_down:
    dims: [process, scenario, snapshot]
    where: (Process_ramp_limit_down OR Process_ramp_limit_shut_down) AND NOT (Process_committable AND
      Process_p_nom_extendable AND NOT (Process_p_nom_mod > 0)) AND Process_ramps_from_previous AND Process_active
    expression: Process_previous_p - Process_p <= Process_ramp_down_allowance
    description: '`Process-p-ramp_limit_down` — a process lowers internal power no faster than its ramp
      limit of the build. A committed one lowers it no further than its shut-down ramp in the snapshot
      it turns off. A process that came into the horizon running has a row at the first snapshot only
      where `p_init` gives the internal power it brought in. No process has one at the start of a later
      investment period, nor does any process a big M releases instead'
  Process_p_ramp_limit_down_run_big_m:
    dims: [process, scenario, snapshot]
    where: Process_com_ext AND (Process_ramp_limit_down OR Process_ramp_limit_shut_down) AND Process_ramps_from_previous
    expression: Process_p - Process_previous_p >= -Process_ramp_down_rate * Process_p_nom_ext - Process_big_m
      + Process_big_m * Process_status
    description: '`Process-p-ramp_limit_down-run-bigM` — a committed extendable process lowers internal
      power no faster than its limit of the chosen build. The big M releases the row in the snapshot it
      turns off'
  Process_p_ramp_limit_down_shut_big_m:
    dims: [process, scenario, snapshot]
    where: Process_com_ext AND (Process_ramp_limit_down OR Process_ramp_limit_shut_down) AND Process_ramps_from_previous
    expression: Process_previous_p - Process_p <= Process_shut_down_rate * Process_p_nom_ext + Process_big_m
      - Process_big_m * Process_shut_down
    description: '`Process-p-ramp_limit_down-shut-bigM` — in the snapshot it turns off, a committed extendable
      process ramps no further than its shut-down ramp of the chosen build. The big M releases the row
      everywhere else'
  Process_p_ramp_limit_up:
    dims: [process, scenario, snapshot]
    where: (Process_ramp_limit_up OR Process_ramp_limit_start_up) AND NOT (Process_committable AND Process_p_nom_extendable
      AND NOT (Process_p_nom_mod > 0)) AND Process_ramps_from_previous AND Process_active
    expression: Process_p - Process_previous_p <= Process_ramp_up_allowance
    description: '`Process-p-ramp_limit_up` — a process raises internal power no faster than its ramp
      limit of the build. A committed one raises it no further than its start-up ramp in the snapshot
      it turns on. A process that came into the horizon running has a row at the first snapshot only where
      `p_init` gives the internal power it brought in. No process has one at the start of a later investment
      period, nor does any process a big M releases instead'
  Process_p_ramp_limit_up_run_big_m:
    dims: [process, scenario, snapshot]
    where: Process_com_ext AND (Process_ramp_limit_up OR Process_ramp_limit_start_up) AND Process_ramps_from_previous
    expression: Process_p - Process_previous_p <= Process_ramp_up_rate * Process_p_nom_ext + Process_big_m
      - Process_big_m * Process_previous_status
    description: '`Process-p-ramp_limit_up-run-bigM` — a committed extendable process raises internal
      power no faster than its limit of the chosen build. The big M releases the row in the snapshot it
      turns on'
  Process_p_ramp_limit_up_start_big_m:
    dims: [process, scenario, snapshot]
    where: Process_com_ext AND (Process_ramp_limit_up OR Process_ramp_limit_start_up) AND Process_ramps_from_previous
    expression: Process_p - Process_previous_p <= Process_start_up_rate * Process_p_nom_ext + Process_big_m
      - Process_big_m * Process_start_up
    description: '`Process-p-ramp_limit_up-start-bigM` — in the snapshot it turns on, a committed extendable
      process ramps no further than its start-up ramp of the chosen build. The big M releases the row
      everywhere else'
  Process_shut_down_p_fixed_upper:
    dims: [process, scenario, snapshot]
    where: Process_committed AND NOT (Process_p_nom_extendable AND Process_p_nom_mod > 0)
    expression: Process_shut_down <= Process_modules_installed
    description: '`Process-shut_down-p-fixed-upper` — a stop is at most the modules in place, an explicit
      row as PyPSA writes it. The bound is one where the build is not modular, and the fixed build''s
      whole count of modules where it is'
  Process_shut_down_p_nom_variable_upper:
    dims: [process, scenario, snapshot]
    where: Process_committed AND Process_p_nom_extendable AND Process_p_nom_mod > 0
    expression: Process_shut_down <= Process_n_mod
    description: '`Process-shut_down-p_nom-variable-upper` — a modular process stops only where a module
      is built'
  Process_start_up_p_fixed_upper:
    dims: [process, scenario, snapshot]
    where: Process_committed AND NOT (Process_p_nom_extendable AND Process_p_nom_mod > 0)
    expression: Process_start_up <= Process_modules_installed
    description: '`Process-start_up-p-fixed-upper` — a start is at most the modules in place, an explicit
      row as PyPSA writes it. The bound is one where the build is not modular, and the fixed build''s
      whole count of modules where it is'
  Process_start_up_p_nom_variable_upper:
    dims: [process, scenario, snapshot]
    where: Process_committed AND Process_p_nom_extendable AND Process_p_nom_mod > 0
    expression: Process_start_up <= Process_n_mod
    description: '`Process-start_up-p_nom-variable-upper` — a modular process starts only where a module
      is built'
  Process_status_p_fixed_upper:
    dims: [process, scenario, snapshot]
    where: Process_committed AND NOT (Process_p_nom_extendable AND Process_p_nom_mod > 0)
    expression: Process_status <= Process_modules_installed
    description: '`Process-status-p-fixed-upper` — a status is at most the modules in place, an explicit
      row as PyPSA writes it. The bound is one where the build is not modular, and the fixed build''s
      whole count of modules where it is'
  Process_status_p_nom_variable_upper:
    dims: [process, scenario, snapshot]
    where: Process_committed AND Process_p_nom_extendable AND Process_p_nom_mod > 0
    expression: Process_status <= Process_n_mod
    description: '`Process-status-p_nom-variable-upper` — a modular process is on only where a module
      is built'
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_injection: {expression: 'sum(Generator_sign * Generator_p, over=generator, by=Generator_bus[bus])'}
  Generator_opex: {expression: 'sum(sum((Generator_running_cost * snapshot_weightings_objective) * at(period_weight_objective,
      by=snapshot_period[period]), over=generator), over=snapshot) + sum(sum((((Generator_p * Generator_p)
      * Generator_marginal_cost_quadratic) * snapshot_weightings_objective) * at(period_weight_objective,
      by=snapshot_period[period]), over=generator), over=snapshot)'}
  Generator_running_cost:
    dims: [generator, scenario, snapshot]
    description: 'what a generator''s output costs in a snapshot: the value read off its piecewise curve
      where it has one, and its linear `marginal_cost` otherwise. A curve replaces the linear cost, as
      PyPSA drops the unit from that term (`optimize.py:333-348`)'
    cases:
      curve: {when: Generator_marginal_cost_curve, expression: Generator_marginal_cost_piecewise}
    otherwise: Generator_p * Generator_marginal_cost
  Link_injection: {expression: '-sum(Link_p, over=link, by=Link_bus0[bus]) + sum(Link_output_arrival,
      over=link_output, by=Link_output_bus[bus])'}
  Link_opex: {expression: 'sum(sum(((Link_p * Link_marginal_cost) * snapshot_weightings_objective) * at(period_weight_objective,
      by=snapshot_period[period]), over=link), over=snapshot) + sum(sum((((Link_p * Link_p) * Link_marginal_cost_quadratic)
      * snapshot_weightings_objective) * at(period_weight_objective, by=snapshot_period[period]), over=link),
      over=snapshot)'}
  Link_output_arrival:
    dims: [link_output, scenario, snapshot]
    description: what a link delivers to an output port at a snapshot. It is its flow delayed by the port's
      `delay` within its investment period. It is multiplied by the port's efficiency at the snapshot
      the flow arrives. Where the port is `cyclic_delay`, the delayed flow wraps from the period's end.
      Where it is not, the flow still in transit at the period's first snapshots is lost. A port that
      does not delay (`delay` zero) delivers its flow unshifted, cyclic or not
    cases:
      wrapping: {when: Link_output_cyclic_delay, expression: 'shift(at(Link_p, by=Link_output_link[link]),
          along=snapshot, offset=Link_output_delay, edge=''wrap'', within=snapshot_period[period]) * Link_efficiency'}
    otherwise: shift(at(Link_p, by=Link_output_link[link]), along=snapshot, offset=Link_output_delay,
      edge=0, within=snapshot_period[period]) * Link_efficiency
  Load_demand:
    dims: [load, scenario, snapshot]
    description: what a load draws from its bus's balance. It is its demand times its sign where it is
      active, and nothing where it is not. PyPSA drops an inactive load from the balance (`constraints.py:1591-1592`)
    cases:
      active: {when: Load_active, expression: Load_sign * Load_p_set}
    otherwise: '0'
  Load_injection: {expression: 'sum(Load_demand, over=load, by=Load_bus[bus])'}
  Process_capex: {expression: sum(scenario_weight * Process_p_nom_ext * Process_capital_cost * Process_capital_weight)}
  Process_commitment_opex: {expression: 'sum(sum(((Process_status * Process_stand_by_cost) * snapshot_weightings_objective)
      * at(period_weight_objective, by=snapshot_period[period]), over=process), over=snapshot) + sum(sum((Process_start_up
      * Process_start_up_cost) * at(period_weight_objective, by=snapshot_period[period]), over=process),
      over=snapshot) + sum(sum((Process_shut_down * Process_shut_down_cost) * at(period_weight_objective,
      by=snapshot_period[period]), over=process), over=snapshot)'}
  Process_injection: {expression: 'sum(Process_output_arrival, over=process_output, by=Process_output_bus[bus])'}
  Process_modules:
    dims: [process, scenario]
    description: 'how many modules a committed process''s status counts: the chosen number where the build
      is extendable and modular, and the modules installed otherwise (`constraints.py:656-661`)'
    cases:
      chosen: {when: Process_p_nom_extendable AND Process_p_nom_mod > 0, expression: Process_n_mod}
    otherwise: Process_modules_installed
  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
  Process_p_carried_over:
    dims: [process, scenario, snapshot]
    description: the output a process carries over into a snapshot. At the first, it is the `p_init` it
      brought in, which is zero where it came in off. After that, it is the previous snapshot's
    cases:
      opening: {when: position(snapshot) == 0, expression: Process_p_init}
    otherwise: shift(Process_p, along=snapshot, offset=1)
  Process_p_nom_committed:
    dims: [process, scenario]
    description: 'the build a committed process''s ramp rows are taken against: one module where the build
      is modular, since its status counts modules, and the given build otherwise (`constraints.py:1131-1134`)'
    cases:
      modular_build: {when: Process_p_nom_mod > 0, expression: Process_p_nom_mod}
    otherwise: Process_p_nom
  Process_p_nom_effective:
    dims: [process, scenario]
    description: 'the build a process''s limits are taken against: the chosen one where it is extendable,
      the given one otherwise'
    cases:
      extendable: {when: Process_p_nom_extendable, expression: Process_p_nom_ext}
    otherwise: Process_p_nom
  Process_previous_p:
    dims: [process, scenario, snapshot]
    description: 'the output a process carries into a snapshot. It is nothing at the first snapshot it
      is active in past the first of the horizon: PyPSA fills an output it did not build with zero (`constraints.py:716`).
      It is the output carried over otherwise'
    cases:
      opening_late: {when: 'position(snapshot) > 0 AND NOT shift(Process_active, along=snapshot, offset=1)',
        expression: '0'}
    otherwise: Process_p_carried_over
  Process_previous_status:
    dims: [process, scenario, snapshot]
    description: the commitment state a process carries into a snapshot. It is off at the first snapshot
      it is active in past the first of the horizon. PyPSA reads a status it did not build as off there
      (`constraints.py:391`). It is the state carried over otherwise
    cases:
      opening_late: {when: 'position(snapshot) > 0 AND NOT shift(Process_active, along=snapshot, offset=1)',
        expression: '0'}
    otherwise: Process_status_carried_over
  Process_ramp_down_allowance:
    dims: [process, scenario, snapshot]
    description: how far a process may lower internal power between two snapshots. It is its ramp limit
      of the build while it stays on, plus its shut-down ramp in the snapshot it turns off
    cases:
      committed: {when: Process_committable, expression: Process_ramp_down_rate * Process_p_nom_committed
          * Process_status + Process_shut_down_rate * Process_p_nom_committed * (Process_ramp_previous_status
          - Process_status)}
    otherwise: Process_ramp_down_rate * Process_p_nom_effective
  Process_ramp_down_rate:
    dims: [process, scenario, snapshot]
    description: the ramp limit in a process's down row, PyPSA's `ramp_limit_down`. It is the full build
      where PyPSA has none, since a shut-down ramp alone builds the row
    cases:
      given: {when: Process_ramp_limit_down, expression: Process_ramp_limit_down}
    otherwise: '1'
  Process_ramp_previous_status:
    dims: [process, scenario, snapshot]
    description: the status a committed process's ramp rows carry into a snapshot. At the first snapshot,
      a fixed modular process that came in running has every module on, since the state it brought in
      is on or off (`constraints.py:1152-1157`). The transition and down-time rows count it as one module
      (PyPSA/PyPSA#2114). It is the state carried in otherwise
    cases:
      opening_modules: {when: position(snapshot) == 0 AND NOT Process_p_nom_extendable AND Process_p_nom_mod
          > 0, expression: Process_status_initial * Process_modules_installed}
    otherwise: Process_previous_status
  Process_ramp_up_allowance:
    dims: [process, scenario, snapshot]
    description: how far a process may raise internal power between two snapshots. It is its ramp limit
      of the build while it stays on, plus its start-up ramp in the snapshot it turns on
    cases:
      committed: {when: Process_committable, expression: Process_ramp_up_rate * Process_p_nom_committed
          * Process_ramp_previous_status + Process_start_up_rate * Process_p_nom_committed * (Process_status
          - Process_ramp_previous_status)}
    otherwise: Process_ramp_up_rate * Process_p_nom_effective
  Process_ramp_up_rate:
    dims: [process, scenario, snapshot]
    description: the ramp limit in a process's up row, PyPSA's `ramp_limit_up`. It is the full build where
      PyPSA has none, since a start-up ramp alone builds the row
    cases:
      given: {when: Process_ramp_limit_up, expression: Process_ramp_limit_up}
    otherwise: '1'
  Process_shut_down_rate:
    dims: [process, scenario]
    description: the shut-down ramp in a process's down row (PyPSA's `ramp_limit_shut_down`), or the full
      build where it has none
    cases:
      given: {when: Process_ramp_limit_shut_down, expression: Process_ramp_limit_shut_down}
    otherwise: '1'
  Process_start_up_rate:
    dims: [process, scenario]
    description: the start-up ramp in a process's up row (PyPSA's `ramp_limit_start_up`), or the full
      build where it has none
    cases:
      given: {when: Process_ramp_limit_start_up, expression: Process_ramp_limit_start_up}
    otherwise: '1'
  Process_status_carried_over:
    dims: [process, scenario, snapshot]
    description: 'the state a process carries over into a snapshot: the state it brought into the horizon
      at the first, the previous snapshot''s after that'
    cases:
      opening: {when: position(snapshot) == 0, expression: Process_status_initial}
    otherwise: shift(Process_status, along=snapshot, offset=1)
  risk_weighted_opex: {expression: 'sum(scenario_weight * scenario_opex, over=scenario)'}
  scenario_opex:
    dims: [scenario]
    expression: ((Generator_opex + Link_opex) + Process_opex) + Process_commitment_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: 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_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`)'}
  Process_com_ext: {condition: Process_committable AND Process_p_nom_extendable AND NOT (Process_p_nom_mod
      > 0) AND Process_active, description: 'a committable process with an extendable, non-modular build
      that is active in the snapshot''s period. These are PyPSA''s `com-ext` rows, whose status is relaxed
      against the chosen build'}
  Process_committed: {condition: Process_committable AND Process_active, description: 'a committable process
      that is active in the snapshot''s period: every unit-commitment row''s set'}
  Process_ramps_from_previous: {condition: 'position(snapshot, within=snapshot_period[period]) > 0 OR
      (position(snapshot) == 0 AND (Process_status_initial == 0 OR Process_p_init))', description: 'a
      snapshot whose ramp uses a previous output. It is any snapshot but its period''s first, and the
      horizon''s first where the process comes in off or carries an initial output'}
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_26_committable_process.yaml', sources) as solution:
    solution.objective  # 15865.125

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

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

"""Rung 26: committable processes — rung 25's committable links restated as processes that draw a quarter more than they deliver."""

from __future__ import annotations

import spine


def build():
    """The spine plus an east bus that only committable processes serve."""
    n = spine.build()
    n.add('Bus', 'east')
    n.add(
        'Process',
        'warm_conv',
        bus0='north',
        bus1='east',
        rate0=-1.25,
        committable=True,
        p_nom=60,
        p_min_pu=0.3,
        marginal_cost=8,
        min_up_time=3,
        min_down_time=2,
        up_time_before=1,
        ramp_limit_up=0.5,
        ramp_limit_down=0.5,
        ramp_limit_start_up=0.6,
        ramp_limit_shut_down=0.6,
        start_up_cost=100,
        shut_down_cost=50,
        stand_by_cost=5,
    )
    n.add(
        'Process',
        'cold_conv',
        bus0='north',
        bus1='east',
        rate0=-1.25,
        committable=True,
        p_nom=40,
        p_min_pu=0.2,
        min_up_time=2,
        min_down_time=3,
        up_time_before=0,
        down_time_before=1,
        start_up_cost=20,
    )
    n.add(
        'Process',
        'ext_conv',
        bus0='north',
        bus1='east',
        rate0=-1.25,
        committable=True,
        p_nom_extendable=True,
        p_nom_max=30,
        capital_cost=5,
        p_min_pu=0.2,
        marginal_cost=2,
        up_time_before=0,
        ramp_limit_up=0.5,
        ramp_limit_down=0.5,
    )
    n.add(
        'Process',
        'mod_conv',
        bus0='south',
        bus1='east',
        rate0=-1.25,
        committable=True,
        p_nom_extendable=True,
        p_nom_mod=10,
        p_nom_max=40,
        capital_cost=3,
        p_min_pu=0.5,
    )
    n.add(
        'Process',
        'mod_fix',
        bus0='north',
        bus1='east',
        rate0=-1.25,
        committable=True,
        p_nom=20,
        p_nom_mod=10,
        p_min_pu=0.5,
        marginal_cost=1,
    )
    n.add('Load', 'east_load', bus='east', p_set=[20, 70, 60, 5])
    return n
n = build()
n.optimize(solver_name='highs')
n.objective  # 15865.125

The data

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

Process_big_m.csv

process,scenario,value
ext_conv,base,30.0
mod_conv,base,40.0

Process_down_time_brought_in.csv

process,scenario,snapshot,value
cold_conv,base,2015-01-01T00:00:00.000000,1.0
cold_conv,base,2015-01-01T01:00:00.000000,1.0
cold_conv,base,2015-01-01T02:00:00.000000,0.0
cold_conv,base,2015-01-01T03:00:00.000000,0.0
ext_conv,base,2015-01-01T00:00:00.000000,0.0
ext_conv,base,2015-01-01T01:00:00.000000,0.0
ext_conv,base,2015-01-01T02:00:00.000000,0.0
ext_conv,base,2015-01-01T03:00:00.000000,0.0
mod_conv,base,2015-01-01T00:00:00.000000,0.0
mod_conv,base,2015-01-01T01:00:00.000000,0.0
mod_conv,base,2015-01-01T02:00:00.000000,0.0
mod_conv,base,2015-01-01T03:00:00.000000,0.0
mod_fix,base,2015-01-01T00:00:00.000000,0.0
mod_fix,base,2015-01-01T01:00:00.000000,0.0
mod_fix,base,2015-01-01T02:00:00.000000,0.0
mod_fix,base,2015-01-01T03:00:00.000000,0.0
warm_conv,base,2015-01-01T00:00:00.000000,0.0
warm_conv,base,2015-01-01T01:00:00.000000,0.0
warm_conv,base,2015-01-01T02:00:00.000000,0.0
warm_conv,base,2015-01-01T03:00:00.000000,0.0

Process_min_down_time.csv

process,scenario,value
cold_conv,base,3
ext_conv,base,0
mod_conv,base,0
mod_fix,base,0
warm_conv,base,2

Process_min_up_time.csv

process,scenario,value
cold_conv,base,2
ext_conv,base,0
mod_conv,base,0
mod_fix,base,0
warm_conv,base,3

Process_p_init.csv

process,scenario,value
cold_conv,base,0.0
ext_conv,base,0.0

Process_p_min_pu_nonneg.csv

process,value
cold_conv,true
ext_conv,true
mod_conv,true
mod_fix,true
warm_conv,true

Process_p_nom_mod.csv

process,value
mod_conv,10.0
mod_fix,10.0

Process_ramp_limit_shut_down.csv

process,scenario,value
warm_conv,base,0.6

Process_ramp_limit_start_up.csv

process,scenario,value
warm_conv,base,0.6

Process_shut_down_cost.csv

process,scenario,snapshot,value
cold_conv,base,2015-01-01T00:00:00.000000,0.0
cold_conv,base,2015-01-01T01:00:00.000000,0.0
cold_conv,base,2015-01-01T02:00:00.000000,0.0
cold_conv,base,2015-01-01T03:00:00.000000,0.0
ext_conv,base,2015-01-01T00:00:00.000000,0.0
ext_conv,base,2015-01-01T01:00:00.000000,0.0
ext_conv,base,2015-01-01T02:00:00.000000,0.0
ext_conv,base,2015-01-01T03:00:00.000000,0.0
mod_conv,base,2015-01-01T00:00:00.000000,0.0
mod_conv,base,2015-01-01T01:00:00.000000,0.0
mod_conv,base,2015-01-01T02:00:00.000000,0.0
mod_conv,base,2015-01-01T03:00:00.000000,0.0
mod_fix,base,2015-01-01T00:00:00.000000,0.0
mod_fix,base,2015-01-01T01:00:00.000000,0.0
mod_fix,base,2015-01-01T02:00:00.000000,0.0
mod_fix,base,2015-01-01T03:00:00.000000,0.0
warm_conv,base,2015-01-01T00:00:00.000000,50.0
warm_conv,base,2015-01-01T01:00:00.000000,50.0
warm_conv,base,2015-01-01T02:00:00.000000,50.0
warm_conv,base,2015-01-01T03:00:00.000000,50.0

Process_stand_by_cost.csv

process,scenario,snapshot,value
cold_conv,base,2015-01-01T00:00:00.000000,0.0
cold_conv,base,2015-01-01T01:00:00.000000,0.0
cold_conv,base,2015-01-01T02:00:00.000000,0.0
cold_conv,base,2015-01-01T03:00:00.000000,0.0
ext_conv,base,2015-01-01T00:00:00.000000,0.0
ext_conv,base,2015-01-01T01:00:00.000000,0.0
ext_conv,base,2015-01-01T02:00:00.000000,0.0
ext_conv,base,2015-01-01T03:00:00.000000,0.0
mod_conv,base,2015-01-01T00:00:00.000000,0.0
mod_conv,base,2015-01-01T01:00:00.000000,0.0
mod_conv,base,2015-01-01T02:00:00.000000,0.0
mod_conv,base,2015-01-01T03:00:00.000000,0.0
mod_fix,base,2015-01-01T00:00:00.000000,0.0
mod_fix,base,2015-01-01T01:00:00.000000,0.0
mod_fix,base,2015-01-01T02:00:00.000000,0.0
mod_fix,base,2015-01-01T03:00:00.000000,0.0
warm_conv,base,2015-01-01T00:00:00.000000,5.0
warm_conv,base,2015-01-01T01:00:00.000000,5.0
warm_conv,base,2015-01-01T02:00:00.000000,5.0
warm_conv,base,2015-01-01T03:00:00.000000,5.0

Process_start_up_cost.csv

process,scenario,snapshot,value
cold_conv,base,2015-01-01T00:00:00.000000,20.0
cold_conv,base,2015-01-01T01:00:00.000000,20.0
cold_conv,base,2015-01-01T02:00:00.000000,20.0
cold_conv,base,2015-01-01T03:00:00.000000,20.0
ext_conv,base,2015-01-01T00:00:00.000000,0.0
ext_conv,base,2015-01-01T01:00:00.000000,0.0
ext_conv,base,2015-01-01T02:00:00.000000,0.0
ext_conv,base,2015-01-01T03:00:00.000000,0.0
mod_conv,base,2015-01-01T00:00:00.000000,0.0
mod_conv,base,2015-01-01T01:00:00.000000,0.0
mod_conv,base,2015-01-01T02:00:00.000000,0.0
mod_conv,base,2015-01-01T03:00:00.000000,0.0
mod_fix,base,2015-01-01T00:00:00.000000,0.0
mod_fix,base,2015-01-01T01:00:00.000000,0.0
mod_fix,base,2015-01-01T02:00:00.000000,0.0
mod_fix,base,2015-01-01T03:00:00.000000,0.0
warm_conv,base,2015-01-01T00:00:00.000000,100.0
warm_conv,base,2015-01-01T01:00:00.000000,100.0
warm_conv,base,2015-01-01T02:00:00.000000,100.0
warm_conv,base,2015-01-01T03:00:00.000000,100.0

Process_up_time_brought_in.csv

process,scenario,snapshot,value
cold_conv,base,2015-01-01T00:00:00.000000,0.0
cold_conv,base,2015-01-01T01:00:00.000000,0.0
cold_conv,base,2015-01-01T02:00:00.000000,0.0
cold_conv,base,2015-01-01T03:00:00.000000,0.0
ext_conv,base,2015-01-01T00:00:00.000000,0.0
ext_conv,base,2015-01-01T01:00:00.000000,0.0
ext_conv,base,2015-01-01T02:00:00.000000,0.0
ext_conv,base,2015-01-01T03:00:00.000000,0.0
mod_conv,base,2015-01-01T00:00:00.000000,0.0
mod_conv,base,2015-01-01T01:00:00.000000,0.0
mod_conv,base,2015-01-01T02:00:00.000000,0.0
mod_conv,base,2015-01-01T03:00:00.000000,0.0
mod_fix,base,2015-01-01T00:00:00.000000,0.0
mod_fix,base,2015-01-01T01:00:00.000000,0.0
mod_fix,base,2015-01-01T02:00:00.000000,0.0
mod_fix,base,2015-01-01T03:00:00.000000,0.0
warm_conv,base,2015-01-01T00:00:00.000000,1.0
warm_conv,base,2015-01-01T01:00:00.000000,1.0
warm_conv,base,2015-01-01T02:00:00.000000,0.0
warm_conv,base,2015-01-01T03:00:00.000000,0.0