Column generation for the discrete Unit Commitment problem with min-stop ramping constraints
Nicolas Dupin · 2019 · arXiv
WASTE classifies this as Negative / Null Result Report · AI classification, approximate
The study found no significant effect — useful as a negative control or null benchmark for your own design.
Abstract (excerpt)
The discrete unit commitment problem with min-stop ramping constraints optimizes the daily production of thermal power plants (coal, gas, fuel units). For this problem, compact Integer Linear Programming (ILP) formulations have been designed to solve exactly small instances and heuristically real-size instances. This paper investigates whether Dantzig-Wolfe reformulation allows to improve the previous exact method and matheuristics. The extended ILP formulation is presented with the column generation algorithm to solve its linear relaxation. The experimental results show that the Dantzig-Wolfe
Excerpt shown for reference under fair use — read the full paper at the publisher.
About to run something similar?
Run an AI Precheck on your own design to catch failure modes like this one before you spend the time. Your first desk check is free.
Related failures
Channeling Fisher: Randomization Tests and the Statistical Insignificance of Seemingly Significant Experimental Results*
Negative / Null Result ReportThe harmonic mean p -value for combining dependent tests
Negative / Null Result ReportGeneralizability of heterogeneous treatment effect estimates across samples
Negative / Null Result ReportNumerical predictors of arithmetic success in grades 1–6
Negative / Null Result ReportMethods Matter: p-Hacking and Publication Bias in Causal Analysis in Economics
Negative / Null Result ReportShould multiple imputation be the method of choice for handling missing data in randomized trials?
WASTE indexes this work — it does not host or republish it. Failure-type classification is automated and approximate.
Metadata source: arXiv