Author Name: John Dombrowski
Steward: Dajun Yue and Fengqi You
McCormick Envelopes are a type of convex relaxation used in bilinear Non Linear Programming problems. Many times these envelopes are used to solve a Mixed Integer Non Linear Programming problem by relaxing the MINLP problem so that it becomes a convex NLP. Solving this convex NLP will provide a lower bound number on the optimal solution of the original MINLP. For more information on solving MINLPs see Spatial Branch and Bound method.
In his original paper, McCormick
Derivation for bilinear term