✦ LIBER ✦

Optimal power flow solved with sequential reduced quadratic programming

✍ Scribed by R. A. M. van Amerongen

Book ID: 105253388
Publisher: Springer
Year: 1988
Tongue: English
Weight: 607 KB
Volume: 71
Category: Article
ISSN: 1432-0487
DOI: 10.1007/bf01597146

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sequential quadratic programming based d

Sequential quadratic programming based differential evolution algorithm for optimal power flow problem

✍ Sivasubramani, S.; Swarup, K.S. 📂 Article 📅 2011 🏛 The Institution of Engineering and Technology 🌐 English ⚖ 232 KB

Optimal electric power scheduling: A lar

Optimal electric power scheduling: A large nonlinear programming test problem solved by recursive quadratic programming

✍ M. C. Biggs; M. A. Laughton 📂 Article 📅 1977 🏛 Springer-Verlag 🌐 English ⚖ 717 KB

Sequential quadratic programming methods

Sequential quadratic programming methods for optimal control problems with state constraints

✍ Xu Chengxian; J. L. de Jong 📂 Article 📅 1993 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 393 KB

The sequential linear quadratic programm

The sequential linear quadratic programming algorithm for solving dynamic optimization problems - a review.

✍ Sverre Støren; Terje Hertzberg 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 618 KB

A semi-infinite programming algorithm fo

A semi-infinite programming algorithm for solving optimal power flow with transient stability constraints

✍ Xiaojiao Tong; Chen Ling; Liqun Qi 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 195 KB

Hybridizing harmony search algorithm wit

Hybridizing harmony search algorithm with sequential quadratic programming for engineering optimization problems

✍ M. Fesanghary; M. Mahdavi; M. Minary-Jolandan; Y. Alizadeh 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 779 KB

This study presents a hybrid harmony search algorithm (HHSA) to solve engineering optimization problems with continuous design variables. Although the harmony search algorithm (HSA) has proven its ability of finding near global regions within a reasonable time, it is comparatively inefficient in per