Experiments with hybrid Bernstein global optimization algorithm for the OPF problem in power systems

DOI10.1080/0305215X.2018.1521399OpenAlexW2898476698WikidataQ129023911 ScholiaQ129023911MaRDI QIDQ5059211

Ashok Krishnan, L. P. M. I. Sampath, H. B. Gooi, Bhagyesh V. Patil, Jan M. Maciejowski, Keck Voon Ling

Publication date: 23 December 2022

Published in: Engineering Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0305215x.2018.1521399

zbMATH Keywords

global optimizationBernstein polynomialspower systemoptimal power flownon-convex problem

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Uses Software

• MATPOWER

Cites Work

• Global optimization with spline constraints: a new branch-and-bound method based on B-splines
• Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
• Multi-objective optimal electric power planning in the power system using Gaussian bare-bones imperialist competitive algorithm
• Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
• An efficient and safe framework for solving optimization problems
• Guided dive for the spatial branch-and-bound
• A polyhedral branch-and-cut approach to global optimization
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Nonlinear integer programming
• Branching and bounds tighteningtechniques for non-convex MINLP
• Introduction to Interval Analysis
• Spatial branch-and-bound algorithm for MIQCPs featuring multiparametric disaggregation
• UNIFIED FIRST LAW AND THERMODYNAMICS OF DYNAMICAL BLACK HOLE IN n-DIMENSIONAL VAIDYA SPACETIME
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Experiments with hybrid Bernstein global optimization algorithm for the OPF problem in power systems