Extended McCormick relaxation rules for handling empty arguments representing infeasibility

Jason Ye () and Joseph K. Scott ()
Additional contact information
Jason Ye: Georgia Institute of Technology
Joseph K. Scott: Georgia Institute of Technology

Journal of Global Optimization, 2023, vol. 87, issue 1, No 3, 57-95

Abstract: Abstract McCormick’s relaxation technique is one of the most versatile and commonly used methods for computing the convex relaxations necessary for deterministic global optimization. The core of the method is a set of rules for propagating relaxations through basic arithmetic operations. Computationally, each rule operates on four-tuples describing each input argument in terms of a lower bound value, an upper bound value, a convex relaxation value, and a concave relaxation value. We call such tuples McCormick objects. This paper extends McCormick’s rules to accommodate input objects that are empty (i.e., the convex relaxation value lies above the concave, or both relaxation values lie outside the bounds). Empty McCormick objects provide a natural way to represent infeasibility and are readily generated by McCormick-based domain reduction techniques. The standard McCormick rules are strictly undefined for empty inputs and applying them anyway can yield relaxations that are non-convex/concave on infeasible parts of their domains. In contrast, our extended rules always produce relaxations that are well-defined and convex/concave on their entire domain. This capability has important applications in reduced-space global optimization, global dynamic optimization, and domain reduction.

Keywords: McCormick relaxations; Reduced space optimization; Global dynamic optimization; Constraint-based refinement (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10898-023-01315-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:87:y:2023:i:1:d:10.1007_s10898-023-01315-7

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-023-01315-7

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().