Tightening McCormick Relaxations Toward Global Solution of the ACOPF Problem
نویسندگان
چکیده
منابع مشابه
Tightening piecewise McCormick relaxations for bilinear problems
We address nonconvex bilinear problems where the main objective is the computation of a tight lower bound for the objective function to be minimized. This can be obtained through a mixed-integer linear programming formulation relying on the concept of piecewise McCormick relaxation. It works by dividing the domain of one of the variables in each bilinear term into a given number of partitions, ...
متن کاملTightening McCormick Relaxations for Nonlinear Programs via Dynamic Multivariate Partitioning
In this work, we propose a two-stage approach to strengthen piecewise McCormick relaxations for mixed-integer nonlinear programs (MINLP) with multi-linear terms. In the first stage, we exploit Constraint Programing (CP) techniques to contract the variable bounds. In the second stage we partition the variables domains using a dynamic multivariate partitioning scheme. Instead of equally partition...
متن کاملMcCormick-Based Relaxations of Algorithms
Theory and implementation for the global optimization of a wide class of algorithms is presented via convex/affine relaxations. The basis for the proposed relaxations is the systematic construction of subgradients for the convex relaxations of factorable functions by McCormick [Math. Prog., 10 (1976), pp. 147–175]. Similar to the convex relaxation, the subgradient propagation relies on the recu...
متن کاملMultivariate McCormick relaxations
McCormick (Math Prog 10(1):147–175, 1976) provides the framework for convex/concave relaxations of factorable functions, via rules for the product of functions and compositions of the form F◦ f , where F is a univariate function. Herein, the composition theorem is generalized to allowmultivariate outer functions F , and theory for the propagation of subgradients is presented. The generalization...
متن کاملDifferentiable McCormick relaxations
McCormick’s classical relaxation technique constructs closed-form convex and concave relaxations of compositions of simple intrinsic functions. These relaxations have several properties which make them useful for lower bounding problems in global optimization: they can be evaluated automatically, accurately, and computationally inexpensively, and they converge rapidly to the relaxed function as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Power Systems
سال: 2019
ISSN: 0885-8950,1558-0679
DOI: 10.1109/tpwrs.2018.2877099