Results 101 to 110 of about 733 (116)
Some of the next articles are maybe not open access.
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
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.
Robert Chang, T. K. Saha
openaire +1 more source
Implementable Three-Phase OPF Formulations for MV-LV Distribution Networks: MILP and MIQCP
2019 IEEE PES Innovative Smart Grid Technologies Conference - Latin America (ISGT Latin America), 2019The increasing uptake of distributed energy resources (DER) poses significant operational challenges to Distribution Network Operators (DNOs). In this context, AC Optimal Power Flow (OPF)-based approaches have the potential to aid DNOs’ decision-making, to enable the operational orchestration of DER and network elements, improving performance while ...
Luis Gutierrez-Lagos +2 more
openaire +1 more source
Monoidal strengthening and unique lifting in MIQCPs
Mathematical ProgrammingzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Antonia Chmiela +2 more
openaire +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 ...
null Kening Chen +3 more
openaire +1 more source
A MIQCP formulation for B-spline constraints
Optimization Letters, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods
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, Nathan Krislock
openaire +1 more source
Spatial branch-and-bound algorithm for MIQCPs featuring multiparametric disaggregation
Optimization Methods and Software, 2016Spatial branch-and-bound (B&B) is widely used for the global optimization of non-convex problems. It basically works by iteratively reducing the domain of the variables so that tighter relaxations can be achieved that ultimately converge to the global optimal solution.
openaire +1 more source
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
openaire +1 more source
Spatial branch and bound algorithm for the global optimization of MIQCPs
2016Abstract We propose a new global optimization algorithm for a class of non-convex mixed-integer nonlinear problems. It involves considering tight relaxations at every node of the spatial branch-and-bound tree by doing optimality based bound tightening upon branching and relying on normalized multiparametric disaggregation.
openaire +1 more source