Diego Tejada
Sessions
10-02
11:06
3min
Clustering for Optimization: Linear Program Reductions with TulipaClustering.jl
Grigory Neustroev, Diego Tejada
TulipaClustering.jl introduces a greedy hull clustering method designed to better preserve constraint-binding extremes in optimization problems, especially within energy systems modeling. This approach yields more accurate reduced models for improved downstream optimization performance.
Posters
Coffee room
10-02
16:51
3min
DuckDB as backend to build optimization models in JuMP.jl
Diego Tejada, Abel Soares Siqueira
We use DuckDB as a backend to generate JuMP variables and constraints using SQL. This enables memory-efficient slicing, reusable indices, and traceable constraints. In TulipaEnergyModel.jl, this reduced preprocessing time and memory usage by up to 50%, improving scalability and clarity.
Posters
Coffee room