Date of Award
Master of Science (MS)
Adams , Warren
Saltzman , Matthew
This paper characterizes the convex hull of the set of n-ary vectors that are lexicographically less than or equal to a given such vector. A polynomial number of facets is shown to be sufficient to describe the convex hull. These facets generalize the family of cover inequalities for the binary case. They allow for advances relative to both the modeling of integer variables using base-n expansions, and the solving of n-ary knapsack problems with weakly super-decreasing coefficients.
Shen, Ruobing, "Convex Hull Characterization of Special Polytopes in n-ary Variables" (2012). All Theses. 1552.