Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 6 of 6 for “"Polyhedral relaxations"”.
-
Enhancing Polyhedral Relaxations for Global Optimization
… preprocessing to facilitate the construction of polyhedral relaxations for global optimization. We design and implement an automatic convexity detection algorithm to exploit the convexity properties of general nonlinear programming problems.
-
Mixed integer bilinear programming with applications to the pooling problem
… results are provided to compare the strengths of polyhedral relaxations of the pooling problem. A novel single node flow relaxation, defined by a bilinear equality constraint and flow balance, is proposed for the pooling problem. Linear valid inequalities in the original space of variables are …
-
Global Optimization of Dynamic Process Systems using Complete Search Methods
… is developed for constructing convex and concave relaxations of solutions of nonlinear parametric ODEs. In addition to better convergence properties, the relaxations so obtained are guaranteed to be no looser than their underlying interval bounds, and are typically tighter in practice. Moreover, …
-
Discrete Optimization Models and Techniques for Problems in Data-Driven Prescriptive Analytics
… and multilinear optimization. We develop new polyhedral results for one problem through the lens of the other problem, and vice versa. Computational experiments show that our formulations provide tighter relaxations and improve the solution times compared to formulations based on modeling …
-
Resource allocation and subset selection: new approaches at the interface between discrete and continuous optimization
… the first part of this thesis, we consider novel polyhedral approaches for the i.i.d. online variant of the classical bipartite matching problem defined as follows: one side of the bipartition is fixed and known in advance, while nodes from the other side appear one at a time as i.i.d. …
-
Geometric Ramifications of the Lovász Theta Function and Their Interplay with Duality
… and convex analysis in a way analogous to how polyhedral combinatorics has been using linear optimization to prove min-max theorems. A unit-distance representation of a graph $G$ maps its nodes to some Euclidean space so that adjacent nodes are sent to pairs of points at distance one. The …