Volumetric Guidance for Handling Triple Products in Spatial Branch-and-Bound
dc.contributor.author | Speakman, Emily | |
dc.date.accessioned | 2017-06-14T18:30:56Z | |
dc.date.available | NO_RESTRICTION | |
dc.date.available | 2017-06-14T18:30:56Z | |
dc.date.issued | 2017 | |
dc.date.submitted | ||
dc.identifier.uri | https://hdl.handle.net/2027.42/136973 | |
dc.description.abstract | Spatial branch-and-bound (sBB) is the workhorse algorithmic framework used to globally solve mathematical mixed-integer non-linear optimization (MINLO) problems. Formulating a problem using this paradigm allows both the non-linearities of a system and any discrete design choices to be modeled effectively. Because of the generality of this approach, MINLO is used in a wide variety of applications, from chemical engineering problems and network design, to medical applications and problems in the airline industry. Due in part to their generality (and therefore wide applicability), MINLO problems are very difficult in general, and consequently, the best ways to implement many details of sBB are not wholly understood. In this work, we provide analytic results guiding the implementation of sBB for a simple but frequently occurring function ‘building block’. As opposed to computationally demonstrating that our techniques work only for a particular set of test problems, we analytically establish results that hold for all problems of the given form. In this way, we also demonstrate that analytic results are indeed obtainable for certain sBB implementation decisions. In particular, we use volume as a geometric measure to compare different convex relaxations for functions involving trilinear monomials (or any three quantities multiplied together). We consider different choices for convexifying the graph of a triple product, and obtain formulae for the volume (in terms of the variable upper and lower bounds) for each of these convexifications. We are then able to order the convexifications with regard to their volume. We also provide computational evidence to support our choice of volume as an effective comparison measure, and show that in the context of triple products, volume is an excellent predictor of the objective function gap. Finally, we use the volume measure to provide guidance regarding branching-point selection in the implementation of sBB. | |
dc.language.iso | en_US | |
dc.subject | Global optimization | |
dc.subject | Spatial branch-and-bound | |
dc.subject | McCormick inequalities | |
dc.subject | Convexification methods for triple products | |
dc.subject | Branching point selection | |
dc.subject | Mixed integer non-linear optimization | |
dc.title | Volumetric Guidance for Handling Triple Products in Spatial Branch-and-Bound | |
dc.type | Thesis | en_US |
dc.description.thesisdegreename | PhD | en_US |
dc.description.thesisdegreediscipline | Industrial & Operations Engineering | |
dc.description.thesisdegreegrantor | University of Michigan, Horace H. Rackham School of Graduate Studies | |
dc.contributor.committeemember | Lee, Jon | |
dc.contributor.committeemember | Compton, Kevin J | |
dc.contributor.committeemember | Epelman, Marina A | |
dc.contributor.committeemember | Shen, Siqian May | |
dc.subject.hlbsecondlevel | Industrial and Operations Engineering | |
dc.subject.hlbtoplevel | Engineering | |
dc.description.bitstreamurl | https://deepblue.lib.umich.edu/bitstream/2027.42/136973/1/eespeakm_1.pdf | |
dc.identifier.orcid | 0000-0002-7352-1355 | |
dc.identifier.name-orcid | Speakman, Emily; 0000-0002-7352-1355 | en_US |
dc.owningcollname | Dissertations and Theses (Ph.D. and Master's) |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.