McCormick envelopes: Difference between revisions

From Cornell University Computational Optimization Open Textbook - Optimization Wiki
Jump to navigation Jump to search
(Added main section headers)
 
mNo edit summary
Line 8: Line 8:


'''Example: Numerical'''
'''Example: Numerical'''
'''McCormick Envelope Piecewise'''


'''Application'''
'''Application'''
Line 16: Line 14:


'''References'''
'''References'''
# Castro, Pedro. "A Tighter Piecewise McCormick    Relaxation for Bilinear Problems." (n.d.): n. pag. 3 June 2014. Web.    6 June 2015. <<nowiki>http://minlp.cheme.cmu.edu/2014/papers/castro.pdf</nowiki>
# 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    <nowiki>https://optimization.mccormick.northwestern.edu/index.php/McCormick_envelopes</nowiki>

Revision as of 12:32, 15 November 2021

Introduction

McCormick Envelopes

Derivation of McCormick Envelopes

Example: Convex Relaxation

Example: Numerical

Application

Conclusion

References

  1. 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
  2. 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.
  3. 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