Date of Award

12-2012

Document Type

Thesis

Degree Name

Master of Science (MS)

Legacy Department

Mathematical Science

Advisor

Belotti, Pietro

Committee Member

Adams , Warren

Committee Member

Saltzman , Matthew

Abstract

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.

Share

COinS