# Difference between revisions of "McCormick envelopes"

m |
m |
||

Line 21: | Line 21: | ||

'''Derivation of McCormick Envelopes''' | '''Derivation of McCormick Envelopes''' | ||

− | + | <nowiki><math>w=xy \\</math></nowiki> | |

− | |||

− | w=xy \\ | ||

x^{L}\leq x\leq x^{U} \\ | x^{L}\leq x\leq x^{U} \\ |

## Revision as of 19:33, 17 November 2021

**Introduction**

Optimization of a non-convex function f(x) is challenging since it may have multiple locally optimal points and it can take a significant amount of time or effort to determine if the problem has no solution or if the solution is global. Gradient based solvers are unable to certify optimality1. Different techniques are used to address this challenge depending on the characteristics of the problem. One technique used is convex envelopes2:

Given a non-convex function f(x), g(x) is a convex envelope of f(x) for X S if:

· g(x) is convex under-estimator of f(x)

· g(x)>=h(x) for all convex under-estimators h(x)

**McCormick Envelopes**

In particular, for bilinear (e.g., x*y, x^{2}) Non-Linear Programming (NLP) problems3, the McCormick Envelope is a type of convex relaxation used for optimization.

In case of an NLP, an LP relaxation is derived by replacing each bilinear term with a new variable and adding four sets of constraints. In the case of an MINLP, an MILP relaxation is derived. This strategy is known as McCormick relaxation.

The LP solution gives a lower bound and any feasible solution gives an upper bound.

As noted by Scott et al4, McCormick envelopes are attractive due to their recursive nature of their definition, which affords wide applicability and easy implementation computationally. Furthermore, these relaxations are typically stronger than those resulting from convexification or linearization procedures.

**Derivation of McCormick Envelopes**

<math>w=xy \\</math>

x^{L}\leq x\leq x^{U} \\

y^{L}\leq y\leq y^{U} \\

where \space\ x^{L}, x^{U}, y^{L}, y^{U} are \space\ upper \space\ and \space\ lower \space\ bound \space\ values \space\ for \space\ x \space\ and \space\ y \space\ respectively \\

a=\left (x-x^{L} \right )\\

b=\left (y-y^{L} \right )\\

a * b\geq 0 \\

a * b=\left ( x-x^{L} \right )\left ( y-y^{L} \right )=xy-x^{L}y-xy^{L}+x^{L}y^{L}\geq 0 \\

w\geq x^{L}y+xy^{L}-x^{L}y^{L} \\

\\

a=\left ( x^{U}-x \right ) \\

b = \left ( y^{U} -y\right ) \\

w\geq x^{U}y+xy^{U}-x^{U}y^{U} \\

\\

a=\left ( x^{U}-x\right )\\

b=\left ( y-y^{L} \right )\\

w\leq x^{U}y+xy^{L}-x^{U}y^{L}\\

\\

a=\left ( x-x^{L} \right )\\

b=\left ( y^{U} \right )-y\\

w\leq xy^{U}+x^{L}y-x^{L}y^{U}\\

The<space>underestimators<space>of<space>the<space>function<space>are<space>represented<space>by:\\

w\geq x^{L}y+xy^{L}-x^{L}y^{L}\\

w\geq x^{U}y+xy^{U}-x^{U}y^{U}\\

The<space>overestimators<space>of<space>the<space>function<space>are<space>represented<space>by:\\

w\geq x^{U}y+xy^{L}-x^{U}y^{L}\\

w\geq x^{U}y+xy^{L}-x^{L}y^{U}\\

\end{align*}

<math>\textstyle \sum_{j=1}^n \displaystyle c_j x_j^* = \textstyle \sum_{i=1}^m \displaystyle b_i y_i^*</math>

**Example: Convex Relaxation**

Good bounds are essential to focusing the feasible solution which may be obtained either by inspection or solving the optimization problem to minimize (maximize) x subject to the same constraints as the original problem.

As noted by Hazaji, state-of-the-art global optimization solvers implement bound contraction techniques in order to improve this bounding procedure. Once bound propagation is completed,

domain partitioning becomes necessary. Spatial branch and bound schemes [6, 7] are among the most effective partitioning methods in global optimization.

By splitting the domain of a given variable, the solver is able to divide the original domain into two smaller regions, further tightening the convex relaxations of each partition.

**Example: Numerical**

**Application**

Bilinear expressions are the most common nonconvex components in mathematical formulations modeling problems in: ^{5}

Chemical engineering 8, 9, 10, 11

Process network problems12 (Quesada & Grossmann, 1995)

Water networks13 (Bagajewicz, 2000)

Pooling and blending14 (Haverly, 1978)

Supply Chain and Transportation 15, 9, 10, 11

Energy Systems 16 17 18 19

**Conclusion**

McCormick Envelopes provide a relaxation technique for bilinear non-convex nonlinear programming problems3. Since non-convex NLP are challenging to solve and may be time or resource intensive, McCormick envelopes are attractive due to their recursive nature of their definition, which affords wide applicability and easy implementation computationally. Furthermore, these relaxations are typically stronger than those resulting from convexification or linearization procedures4.

**References**

- Castro, Pedro. "A Tighter Piecewise McCormick Relaxation for Bilinear Problems." (n.d.): n. pag. 3 June 2014. Web. 6 June 2015. <http://minlp.cheme.cmu.edu/2014/papers/castro.pdf
- You, F (2021). Notes for a lecture on Mixed Integer Non-Linear Programming (MINLP). Archives for SYSEN 5800 Computational Optimization (2021FA), Cornell University, Ithaca, NY.
- Dombrowski, J. (2015, June 7). Northwestern University Open Text Book on Process Optimization, McCormick Envelopes Retrieved from https://optimization.mccormick.northwestern.edu/index.php/McCormick_envelopes
- 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
- Hijazi, H., Perspective Envelopes for Bilinear Functions, unpublished manuscript, The Australian National University, Canberra, Australia 4841.pdf
- Androulakis, I., Maranas, C., Floudas, C.: alphabb: A global optimization method for general constrained nonconvex problems. Journal of Global Optimization 7(4), 337{363 (1995)
- Smith, E., Pantelides, C.: A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex fMINLPsg. Computers & Chemical Engineering 23(4), 457 { 478 (1999)
- Geunes, J., Pardalos, P.: Supply chain optimization, vol. 98. Springer Science & BusinessMedia (2006)
- Nahapetyan, A.: Bilinear programming: applications in the supply chain management bilinear programming: Applications in the supply chain management. In: C.A. Floudas, P.M. Pardalos (eds.) Encyclopedia of Optimization, pp. 282{288. Springer US (2009)
- Nahapetyan, A.G., Pardalos, P.M.: A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems. Computers & Operations Research 35(5), 1601 { 1612 (2008). Part Special Issue: Algorithms and Computational Methods in Feasibility and Infeasibility
- Rebennack, S., Nahapetyan, A., Pardalos, P.: Bilinear modeling solution approach for_xed charge network ow problems. Optimization Letters 3(3), 347{355 (2009)
- Quesada, Ignacio & Grossmann, Ignacio. (1995). A Global Optimization Algorithm for Linear Fractional and Bilinear Programs. Journal of Global Optimization. 6. 39-76. 10.1007/BF01106605.
- Bagajewicz, 2000
- Haverly, 1978
- Geunes, J., Pardalos, P.: Supply chain optimization, vol. 98. Springer Science & Business Media (2006)
- Co_rin, C., Hijazi, H., Van Hentenryck, P., Lehmann, K.: Primal and dual bounds for optimal transmission switching. Proceedings of the 18th Power Syst. Computation Conf., Wroclaw Poland, PSCC (2014)
- Gemine, Q., Ernst, D., Louveaux, Q., Corn_elusse, B.: Relaxations for multi-period optimal power ow problems with discrete decision variables. Proceedings of the 18th Power Syst. Computation Conf., Wroclaw, Poland, PSCC 2014 (2014)
- Hijazi, H., Corin, C., Van Hentenryck, P.: Convex Quadratic Relaxations for Mixed-Integer Nonlinear Programs in Power Systems. NICTA Technical Report (2014)
- Hijazi, H., Thiebaux, S.: Optimal AC distribution systems reconfiguration. Proceedings of the 18th Power Syst. Computation Conf., Wroclaw, Poland, PSCC 2014 (2014)