Back to search

Clemson University

Convex Hull Characterization of Special Polytopes in n-ary Variables

Abstract

dc:description.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.

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Mathematical Science

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Shen, Ruobing
Contributors dc:contributor
  • Belotti, Pietro
  • Adams , Warren
  • Saltzman , Matthew

Subjects

dc:subject × 5

Identifiers

dc:identifier.*
Repository record dc:identifier
https://open.clemson.edu/all_theses/1552

Chain of custody

source
Harvested from
Clemson University
Base URL
open.clemson.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Shen, Ruobing. Convex Hull Characterization of Special Polytopes in n-ary Variables. Thesis thesis, https://open.clemson.edu/all_theses/1552