Optimal unit commitment by branch-and-bound exploiting dual optimization conditions
From MaRDI portal
Recommendations
- Optimal Control Formulations for the Unit Commitment Problem
- Lagrangian duality and branch-and-bound algorithms for optimal power flow
- scientific article; zbMATH DE number 978508
- scientific article; zbMATH DE number 1308831
- The models and optimization method for power system unit commitment problems
- Tight MIP formulations of the power-based unit commitment problem
- On Mixed-Integer Programming Formulations for the Unit Commitment Problem
- A deterministic method for the unit commitment problem in power systems
- Commitment and dispatch of heat and power units via affinely adjustable robust optimization
- A Polyhedral Study on Fuel-Constrained Unit Commitment
Cited in
(12)- Lagrangian duality and branch-and-bound algorithms for optimal power flow
- scientific article; zbMATH DE number 978508 (Why is no real title available?)
- Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem
- The summed start-up costs in a unit commitment problem
- Modified orbital branching for structured symmetry with an application to unit commitment
- Bundle relaxation and primal recovery in unit commitment problems. The Brazilian case
- A comparative study of three different mathematical methods for solving the unit commitment problem
- Optimal Control Formulations for the Unit Commitment Problem
- A polynomial-time algorithm with tight error bounds for single-period unit commitment problem
- Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty
- Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
- Fast computation of global solutions to the single-period unit commitment problem
This page was built for publication: Optimal unit commitment by branch-and-bound exploiting dual optimization conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2740061)
