Results 101 to 110 of about 771 (124)
Some of the next articles are maybe not open access.
A MIQCP formulation for B-spline constraints
Optimization Letters, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bjarne Grimstad
exaly +2 more sources
A Joint Planning of DG and Distribution Network Considering Network Loss Based on MIQCP
2021 IEEE International Conference on Electrical Engineering and Mechatronics Technology (ICEEMT), 2021Network loss is a considerable factor in power system operation but usually ignored during planning stage due to the computation efficiency problem. This paper proposes a MIQCP-based distribution network planning model considering network loss. The proposed model minimizes the total cost including investment cost and operating cost and optimizes the ...
Xiaoyang Lian +4 more
exaly +2 more sources
Application of MIQCP based SVC allocation method to a complex real-world grid
2012 IEEE Power and Energy Society General Meeting, 2012This paper demonstrates the applicability of a recently reported mixed integer quadratically constrained programming (MIQCP) placement algorithm on a large scale real-world power system, based on maximizing loadability. The MIQCP algorithm partially incorporates key quadratic constraints, which were absent in MILP placement methods reported in the past.
Tapan Kumar Saha
exaly +2 more sources
Security evaluation for distribution power system using improved MIQCP based restoration strategy
ISGT 2014, 2014Outage load caused by N−1 contingencies can be restored automatically or manually in distribution network. Therefore, the restored load can be considered as an index to represent the distribution network security level. In this paper, a security evaluation method is proposed, in which a MIQCP (Mixed Integer Quadratic Constrained Programming) based ...
Wenchuan Wu, Boming Zhang
exaly +2 more sources
Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods
Springer Proceedings in Mathematics and Statistics, 2015We survey several recent advances on applying semidefinite programming (SDP) techniques to globally solve mixed-integer quadratically constrained programs (MIQCPs), or to construct convex relaxations with better tightness/complexity ratios. It is well known that on many MIQCPs, convex relaxations using SDP techniques produce some of the strongest ...
Hongbo Dong
exaly +2 more sources
An MIQCP Reformulation for the Optimal Synthesis of Thermally Coupled Distillation Networks
Systems and Control TransactionsSuperstructure based approaches have long been employed for optimal process synthesis problems. Due to the difficulties of using rigorous process models and simultaneous solutions, shortcut calculations have been the preferred means of modeling unit operations within larger process network problems.
Kevin Pfau +4 more
exaly +2 more sources
Global optimization of MIQCPs with dynamic piecewise relaxations
Journal of Global Optimization, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pedro A. Castillo Castillo +2 more
openaire +1 more source
2011
This paper surveys results on the NP-hard mixed-integer quadratically constrained programming problem. The focus is strong convex relaxations and valid inequalities, which can become the basis of efficient global techniques. In particular, we discuss relaxations and inequalities arising from the algebraic description of the problem as well as from ...
Samuel Burer, Anureet Saxena
openaire +1 more source
This paper surveys results on the NP-hard mixed-integer quadratically constrained programming problem. The focus is strong convex relaxations and valid inequalities, which can become the basis of efficient global techniques. In particular, we discuss relaxations and inequalities arising from the algebraic description of the problem as well as from ...
Samuel Burer, Anureet Saxena
openaire +1 more source