An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems

DOI10.1287/opre.25.3.387zbMath0383.90065MaRDI QIDQ4162955

John A. Muckstadt, Sherri A. Koenig

Publication date: 1977

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.25.3.387

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90C11: Mixed integer programming

90B35: Deterministic scheduling theory in operations research

90B99: Operations research and management science

Related Items

Stochastic unit commitment problem, The omnipresence of Lagrange, A hybrid biased random key genetic algorithm approach for the unit commitment problem, Solving the short-term electrical generation scheduling problem by an adaptive evolutionary approach, Application of Lagrangian relaxation to computer network control, Scheduling of plant maintenance personnel, A heuristic decomposition approach to optimal control in a water supply model, A scheduling model for the daily operation of an electric power system, A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality, Optimal scheduling of a hydro thermal power generation system, Solving the unit commitment problem by a unit decommitment method, Heuristic solutions to the long-term unit commitment problem with cogeneration plants, Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint, A computer model for power system control, A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints, Min-up/min-down polytopes, Stochastische Modelle zur optimalen Lastverteilung in einem Kraftwerksverbund