Sequential Lagrangian-MILP approaches for Unit Commitment problems
Authors:
- Antonio FrangioniAFAntonio Frangioni
- Claudio GentileCGClaudio Gentile
- 1 March 2011
- journal article
- Published by Elsevier in International Journal of Electrical Power & Energy Systems
- Vol. 33 (3) , 585-593
Abstract
No abstract availableKeywords
This publication has 39 references indexed in Scilit:
- A Feasibility Pump for mixed integer nonlinear programsMathematical Programming, 2008
- Prim-based support-graph preconditioners for min-cost flow problemsComputational Optimization and Applications, 2007
- Solving the unit commitment problem of hydropower plants via Lagrangian Relaxation and Sequential Quadratic ProgrammingComputational and Applied Mathematics, 2005
- About Lagrangian Methods in Integer OptimizationAnnals of Operations Research, 2005
- Perspective cuts for a class of convex 0–1 mixed integer programsMathematical Programming, 2005
- A primal-proximal heuristic applied to the French Unit-commitment problemMathematical Programming, 2005
- The feasibility pumpMathematical Programming, 2005
- Experiences with mixed integer linear programming based approaches on short-term hydro schedulingIEEE Transactions on Power Systems, 2001
- An interior-point/cutting-plane method to solve unit commitment problemsIEEE Transactions on Power Systems, 2000
- Short-term hydro-thermal coordination by Lagrangian relaxation: solution of the dual problemIEEE Transactions on Power Systems, 1999