On the Cutting Plane Methods for Lagrangian Relaxaion Based Unit Commitment Algorithm

IEEJ Transactions on Power and Energy - Japan
doi 10.1541/ieejpes1990.121.11_1435
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electrical Engineers of Japan (IEE Japan)

Related search

Unit Commitment Based on Modified Firefly Algorithm

Measurement and Control
ControlInstrumentationApplied MathematicsOptimization
2020English

Unit Commitment in Wind Farms Based on a Glowworm Metaphor Algorithm

Electric Power Systems Research
Electronic EngineeringPower TechnologyElectricalEnergy Engineering
2015English

A Nontangential Cutting Plane Algorithm

2001English

A Cutting Plane Algorithm for Modularity Maximization Problem

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
2017English

Price-Based Unit Commitment: A Case of Lagrangian Relaxation Versus Mixed Integer Programming

IEEE Transactions on Power Systems
Electronic EngineeringPower TechnologyElectricalEnergy Engineering
2005English

The Performance of the PSO Algorithm for Solving Unit Commitment Problem

International Journal for Research in Applied Science and Engineering Technology
2018English

A Quick Method for Judging the Feasibility of Security-Constrained Unit Commitment Problems Within Lagrangian Relaxation Framework

Energy and Power Engineering
2012English

A Cutting-Plane Algorithm for Minimum-Time Trajectory Planning of Industrial Robots

English

Operating Reserve Allocation Methods Relative to Energy Unit Commitment

DEStech Transactions on Environment, Energy and Earth Science
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy