HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

A Primal-Proximal Heuristic Applied to the Unit-Commitment Problem

Abstract : This paper is devoted to the numerical resolution of unit-commitment problems. More precisely we present the French model optimizing the daily production of electricity. Its resolution is done is two phases: first a Lagrangian relaxation solves the dual to find a lower bound; it also gives a primal relaxed solution. The latter is used in the second phase for a heuristic resolution based on a primal proximal algorithm. This second step comes as an alternative to an earlier approach based on augmented Lagrangian (i.e. a dual proximal algorithm). We illustrate the method with some real-life numerical results. A companion paper is devoted to a theoretical study of the heuristic in the second phase.
Document type :
Complete list of metadata

Cited literature [34 references]  Display  Hide  Download

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 6:09:39 PM
Last modification on : Thursday, January 20, 2022 - 4:19:28 PM
Long-term archiving on: : Sunday, April 4, 2010 - 10:28:11 PM


  • HAL Id : inria-00071600, version 1



Louis Dubost, Robert Gonzalez, Claude Lemaréchal. A Primal-Proximal Heuristic Applied to the Unit-Commitment Problem. [Research Report] RR-4978, INRIA. 2003. ⟨inria-00071600⟩



Record views


Files downloads