{"id":{"repo_id":"clemson","oai_identifier":"oai:open.clemson.edu:all_theses-2552"},"canonical_url":"https://search.ndltd.org/etd/clemson/oai:open.clemson.edu:all_theses-2552","repository":{"repo_id":"clemson","name":"Clemson University","base_url":"https://open.clemson.edu/do/oai/"},"display":{"title":"Convex Hull Characterization of Special Polytopes in n-ary Variables","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Shen, Ruobing"],"institution":null,"degree_name":"Master of Science (MS)","degree_level":"Thesis","degree_discipline":"Mathematical Science","degree_department":null,"school":null,"contributors":["Belotti, Pietro","Adams , Warren","Saltzman , Matthew"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T07:08:42Z","subjects":["convex hull","facets","knapsack problem","n-ary optimization","Applied Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://open.clemson.edu/all_theses/1552","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://open.clemson.edu/all_theses/1552","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://open.clemson.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Aopen.clemson.edu%3Aall_theses-2552","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Belotti, Pietro","Adams , Warren","Saltzman , Matthew"]},{"key":"dc:creator","label":"Author","values":["Shen, Ruobing"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2015-09-30T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2012-12-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematical Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["convex hull","facets","knapsack problem","n-ary optimization","Applied Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://open.clemson.edu/all_theses/1552"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["Convex Hull Characterization of Special Polytopes in n-ary Variables"]}]}],"canonical_facts":{"dc:contributor":["Belotti, Pietro","Adams , Warren","Saltzman , Matthew"],"dc:creator":["Shen, Ruobing"],"dc:date.available":["2015-09-30T07:00:00Z"],"dc:date.created":["2012-12-01T08:00:00Z"],"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."],"dc:identifier":["https://open.clemson.edu/all_theses/1552"],"dc:subject":["convex hull","facets","knapsack problem","n-ary optimization","Applied Mathematics"],"dc:title":["Convex Hull Characterization of Special Polytopes in n-ary Variables"],"thesis:degree_discipline":["Mathematical Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T07:08:42Z"}