Examples

Each page here shows one whole model as the file and as the math it prints. Every model is a file under examples/ in the repository.

• Least-cost dispatch is the smallest whole model. It has a balance, a bound and a cost to minimise.
• Unit commitment adds a start-up ramp. One quantity is defined by region, so a single inequality covers both regimes.
• One construct per model declares each operator in the smallest file that can, and prints the equation beside it.
• A curve by convex combination is the floor of the piecewise family: one weight per breakpoint, one row summing them to 1, and one row per link. The three pages after it are the same model, restricted another way.
• A curve that is not convex adds a binary per segment and the two rows that hold the weights on it. This is what the default method builds.
• A curve as a special-ordered set hands that same restriction to the solver. The binaries and their rows are gone, and a declaration stands where they were.
• A curve as segment lines states the curve as inequalities instead of breakpoints, and declares no auxiliary variable at all.

The PyPSA parity pages, from PyPSA in one file on, are a proof of concept. They sit in the Development section.

Typeset the math prints your own.