Accession Number:

ADA025603

Title:

Representations of Unbounded Optimizations as Integer Programs.

Descriptive Note:

Research rept.,

Corporate Author:

CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP

Personal Author(s):

Report Date:

1976-04-01

Pagination or Media Count:

16.0

Abstract:

Any optimization problem in a finite structure can be represented as an integer or mixed-integer program in integral quantities. It is shown that when an optimization problem on an unbounded structure has such a representation, it is very close to a linear programming problem, in the specific sense described in the following results. It is also shown that, if an optimization problem has such a representation, no more than n 2 equality constraints need be used, where n is the number of variables of the problem.

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE