An improved Lagrangian relaxation algorithm for the robust generation self-scheduling problem

DOI10.1155/2018/6303596zbMath1427.90133OpenAlexW2884506873MaRDI QIDQ1721218

Ping Che, Zhenhao Tang, Hua Gong, Xiaoli Zhao

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2018/6303596

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Self-scheduling of a power generating company: carbon tax considerations
• Robust optimization-based generation self-scheduling under uncertain price
• Improved Lagrangean decomposition: An application to the generalized assignment problem
• Robust discrete optimization and network flows
• Bundle relaxation and primal recovery in unit commitment problems. The Brazilian case
• Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Short-Term Scheduling of Thermal-Electric Generators Using Lagrangian Relaxation
• The Lagrangian Relaxation Method for Solving Integer Programming Problems

This page was built for publication: An improved Lagrangian relaxation algorithm for the robust generation self-scheduling problem