Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Reports, Documentation, and Standards
  4. HIERARCHICAL OPTIMIZATION OF REACTIVE POWER WITH LINEAR PROGRAMMING.
 
research report

HIERARCHICAL OPTIMIZATION OF REACTIVE POWER WITH LINEAR PROGRAMMING.

Chamorel, Pierre-Andre
•
Germond, Alain J.
1984

An iterative and decoupled method is proposed for solving the general active/reactive constrained power flow problem, based on rectangular coordinates of injected currents. Successive linear programming with dual-relaxation method is used. The general objective function is designed to accommodate security improvement as well as economical optimization, including system active losses. A hierarchical approach for reactive optimization is proposed. A whole optimization problem is thus subdivided into several subproblems which can be optimized independently, starting from predetermined boundary conditions. The performance of the algorithms is evaluated on real systems.

  • Details
  • Metrics
Type
research report
Author(s)
Chamorel, Pierre-Andre
Germond, Alain J.
Date Issued

1984

Subjects

MATHEMATICAL PROGRAMMING

•

LINEAR - Applications

•

HIERARCHICAL OPTIMIZATION

•

ITERATIVE AND DECOUPLED METHOD

•

SUBPROBLEMS

•

DUAL-RELAXATION METHOD

•

SYSTEM ACTIVE LOSSES

•

ACTIVE/REACTIVE CONSTRAINED POWER FLOW

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
LRE  
Available on Infoscience
April 4, 2007
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/4339
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés