Difference between revisions of "McCormick envelopes"

From Cornell University Computational Optimization Open Textbook - Optimization Wiki
Jump to navigation Jump to search
m
Line 7: Line 7:
  
 
== '''McCormick Envelopes: Theory, Methodology and Algorithmic Discussions''' ==
 
== '''McCormick Envelopes: Theory, Methodology and Algorithmic Discussions''' ==
The McCormick Envelope, originally developed by Dr. Garth McCormick<sup>1</sup>, is a type of convex relaxation used for the optimization of bilinear (e.g., x*y, e<sup>xy</sup> + y, sin (x+y) - x<sup>2</sup>) non-linear programming (NLP) problems.  As McCormick<sup>1</sup> noted, McCormick Envelopes are based on the key assumption that a convex and a concave envelopes can be constructed for the given function.   
+
The McCormick Envelope, originally developed by Dr. Garth McCormick<sup>1</sup>, is a type of convex relaxation used for the optimization of bilinear (e.g., x*y, e<sup>xy</sup> + y, sin (x+y) - x<sup>2</sup>) non-linear programming (NLP) problems.  As McCormick<sup>1</sup> noted, McCormick Envelopes are based on the key assumption that convex and concave envelopes can be constructed for the given function.   
  
 
Each bilinear term is replaced with a new variable and four sets of constraints are added. The non-linear programming is converted to a relaxed convex linear programming (LP) which can be more easily solved.  
 
Each bilinear term is replaced with a new variable and four sets of constraints are added. The non-linear programming is converted to a relaxed convex linear programming (LP) which can be more easily solved.  
Line 112: Line 112:
  
 
<math>x^L \leq x \leq x^U,  \ \ u^L \leq u \leq u^U</math>
 
<math>x^L \leq x \leq x^U,  \ \ u^L \leq u \leq u^U</math>
 +
 +
Similar steps are taken to derive the McCormick Envelopes for given functions with different formats e.g., e<sup>xy</sup>.
  
 
Good lower and upper bounds focus and minimize the feasible solution space; they reduce the number of iterations to find the optimal solution.   
 
Good lower and upper bounds focus and minimize the feasible solution space; they reduce the number of iterations to find the optimal solution.   

Revision as of 09:02, 28 November 2021

Author: Susan Urban (smu29) (SYSEN 5800 Fall 2021)

Introduction

Optimization of a non-convex function f(x) is challenging since it may have multiple locally optimal solutions or no solution and it can take a significant amount of time, computing resources, and effort to determine if the solution is global or the problem has no feasible solution. Different techniques are used to address this challenge depending on the characteristics of the problem.

Figure 1: Relationships between the given function, concave over-estimators, convex under-estimators, a convex envelope, and a concave envelope.

One technique used for a given non-convex function is the identification of a concave envelope and a convex envelope. The concave envelope, and respectively the convex envelope, is the concave over-estimator and convex under-estimator for the given function providing the tightest fit to the given function. The envelope surrounds the given function, like an envelope encloses a letter, and limits the feasible solution space the most in comparison to all other concave over-estimators and convex under-estimators. Multiple concave over-estimators and multiple convex under-estimators may exist but there is only one concave envelope and one convex envelope for a given function and domain. Figure 1 depicts the relationship between the given function f(x), multiple concave over-estimators, multiple convex under-estimators, a convex envelope, and a concave envelope.

McCormick Envelopes: Theory, Methodology and Algorithmic Discussions

The McCormick Envelope, originally developed by Dr. Garth McCormick1, is a type of convex relaxation used for the optimization of bilinear (e.g., x*y, exy + y, sin (x+y) - x2) non-linear programming (NLP) problems. As McCormick1 noted, McCormick Envelopes are based on the key assumption that convex and concave envelopes can be constructed for the given function.

Each bilinear term is replaced with a new variable and four sets of constraints are added. The non-linear programming is converted to a relaxed convex linear programming (LP) which can be more easily solved.

The LP solution gives a lower (L) bound and any feasible solution to the problem gives an upper (U) bound.

As noted by Scott et al2, McCormick envelopes are effective since they are recursive, can be applied to a variety of applications, and are typically stronger than those resulting from convexification or linearization procedures.

The following is a derivation of the McCormick Envelopes for a given bilinear function:

where are   upper  and   lower  bound  values  for   and , respectively.

a and b are both positive resulting in a positive product

substituting w=xy and reformulating the inequality produces

Following the same sequence of steps, the remaining inequalities are produced:

The under-estimators of the function are represented by:

The over-estimators of the function are represented by:

The following shows the relaxation of a non-convex problem using McCormick Envelopes:

The original non-convex problem:

Replacing , we obtain a relaxed, convex problem using McCormick Envelopes:

Similar steps are taken to derive the McCormick Envelopes for given functions with different formats e.g., exy.

Good lower and upper bounds focus and minimize the feasible solution space; they reduce the number of iterations to find the optimal solution.

Piecewise McCormick Relaxation

As discussed by Hazaji3, global optimization solvers focus initially on optimizing the lower and upper bounds, and when necessary, focus on domain partitioning. By dividing the domain of a given variable into partitions or smaller regions, the solver is able to tailor and further tighten the convex relaxations of each partition. This strategy is known as the Piecewise McCormick relaxation4.

Example: Numerical

Using GAMS, the solution is z= -76.2, x=10, y=1.8.

GAMS code sample:

variable z;

positive variable x, y, w;

equations  obj, c1, c2, c3, c4, c5 ;

obj..    z =e= -w -6*x + y;

c1..     w =l= 18 ;

c2..     w =g= 0;

c3..     w =g= 10*y +2*x -20;

c4..     w =l= 10*y;

c5..     w =l= 2*x;

x.up = 10;

x.lo =0;    

y.up = 2;       

y.lo = 0;

model course5800 /all/;

option mip = baron;

option optcr = 0;

solve course5800 minimizing z using mip ;

Applications

Bilinear functions occur in numerous engineering and natural science applications where McCormick Envelopes can be utilized, including the following :

Computer vision 5

Energy conversion networks 6

Cellular networks7

Dynamic biological systems8

Alternate current optimal power flow (ACOPF)9

Conclusion

Non-convex NLPs are challenging to solve and may require a significant amount of time, computing resources, and effort to determine if the solution is global or the problem has no feasible solution. McCormick Envelopes provide a relaxation technique for bilinear non-convex nonlinear programming problems. McCormick Envelopes provide a straightforward technique of replacing each bilinear term with a new variable and adding four constraints. Due to the recursive nature of this technique, it may be applied to a wide variety of engineering and scientific applications involving bilinear terms.

References

  1. McCormick, Garth P.  (1976). Computability of Global Solutions To Factorable Nonconvex Solutions: Part I: Convex Underestimating Problems. Mathematical Programming, 10, 147-175. doi: 10.1007/BF01580665
  2. Scott, J. K. Stuber, M. D. & Barton, P. I. (2011). Generalized McCormick Relaxations. Journal of Global Optimization, Vol. 51, Issue 4, 569-606 doi: 10.1007/s10898-011-9664-7
  3. Hijazi, H., Perspective Envelopes for Bilinear Functions, unpublished manuscript, retrieved from: Perspective Envelopes for Bilinear Functions
  4. Bergamini, M., Aguirre, P. & Grossman, I. (2005). Logic-based outer approximation for globally optimal synthesis of process networks. Computers and Chemical Engineering 29 (2005) 1914–1933.
  5. Chandraker, M. & Kriegman, D. (n.d.): Globally Optimal Bilinear Programming for Computer Vision Applications. University of San Diego, CA. Retrieved from: http://vision.ucsd.edu
  6. Kantor, J., & Mousaw, P. (2012). A class of bilinear models for the optimization of energy conversion networks. Chemical Engineering Science, 67, 131-138. doi: 10.1016/j.ces.2011.08.033
  7. Ahmed, F., Naeem, M., Ejaz, W. et al. Renewable Energy Assisted Sustainable and Environment Friendly Energy Cooperation in Cellular Networks. Wireless Pers Commun 108, 2585–2607 (2019). https://doi.org/10.1007/s11277-019-06539-z
  8. Miro et al.: Deterministic global optimization algorithm based on outer approximation for the parameter estimation of nonlinear dynamic biological systems. BMC Bioinformatics (2012) 13:90. doi: 10.1186/1471-2105-13-90 ·
  9. Michael B., Castillo, A., Watson, J., & Laird, C. (2018) Strengthened SOCP Relaxations for ACOPF with McCormick Envelopes and Bounds Tightening, Computer Aided Chemical Engineering, 44, 1555-1560, doi: /10.1016/B978-0-444-64241-7.50254-8.