On the Polyhedrality of the Convex Hull of the Feasible Set of an Integer Program.

Abstract

Polyhedrality is established for convex hulls of sets defined by systems of equations in non-negative integer variables. This property is useful for certain existence, duality, and sensitivity results in integer programming. The structural theorems obtained also shed some light on the relationship between the convex hull and the relaxation obtained by deleting integrality constraints. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1976
Accession Number
ADA031964

Entities

People

  • M. L. Wage
  • R. R. Meyer

Organizations

  • University of Wisconsin–Madison

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Computer Programming
  • Contracts
  • Equations
  • Evolutionary Algorithms
  • Inequalities
  • Integer Programming
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • North Carolina
  • Numbers
  • Operations Research
  • Real Numbers
  • Sensitivity
  • United States
  • Universities
  • Wisconsin

Fields of Study

  • Mathematics

Readers

  • Asian Economic Studies
  • Graph Algorithms and Convex Optimization.
  • Mathematical Modeling and Probability Theory.