On the Existence of Optimal Solutions to Integer and Mixed-Integer Programming Problems.

Abstract

The purpose of the paper is to present sufficient conditions for the existence of optimal solutions to integer and mixed-integer programming problems in the absence of upper bounds on the integer variables. It is shown that (in addition to feasibility and boundedness of the objective function) in the pure integer case a sufficient condition is that all of the constraints (other than non-negativity and integrality of the variables) be equalities, and that in the mixed-integer case rationality of the constraint coefficients is sufficient. Some computational implications of these results are also given. (Author)

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1973
Accession Number
AD0767124

Entities

People

  • R. R. Meyer

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Coefficients
  • Computer Programming
  • Computing-Related Activities
  • Integer Programming
  • Interdisciplinary Science
  • Mathematical Programming
  • Mathematics

Fields of Study

  • Mathematics

Readers

  • Operations Research