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

Energy and Power Engineering
doi 10.4236/epe.2012.46057
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Scientific Research Publishing, Inc,

Related search

Lagrangian Relaxation and Enumeration for Solving Constrained Shortest-Path Problems

2007English

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

IEEE Transactions on Power Systems
Electronic EngineeringPower TechnologyElectricalEnergy Engineering
2005English

Impact Evaluation of Electric Vehicle Parking on Solving Security-Constrained Unit Commitment Problem

Mathematical and Computational Applications
2018English

A Nonlinear Lagrangian Approach to Constrained Optimization Problems

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2001English

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

IEEJ Transactions on Power and Energy
Electronic EngineeringPower TechnologyElectricalEnergy Engineering
2001English

A Feasibility-Preserving Crossover and Mutation Operator for Constrained Combinatorial Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

A Feasibility-Preserving Local Search Operator for Constrained Discrete Optimization Problems

2008English

A General Hamilton-Jacobi Framework for Non-Linear State-Constrained Control Problems

ESAIM - Control, Optimisation and Calculus of Variations
ControlComputational MathematicsOptimizationSystems Engineering
2012English

A Memetic Evolutionary Multi-Objective Optimization Method for Environmental Power Unit Commitment

IEEE Transactions on Power Systems
Electronic EngineeringPower TechnologyElectricalEnergy Engineering
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy