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 1 of 1 for “"n-ary optimization"”.

  1. Convex Hull Characterization of Special Polytopes in n-ary Variables

    … 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 …

    clemson Repository record for Convex Hull Characterization of Special Polytopes in n-ary Variables (opens in a new tab)