Scholion.ai

Technical Note—Rationalizing Discrete Programs

F. J. Gould, D. S. Rubin

Operations Research · 1973 · Volume 21 · Issue 1

DOI: 10.1287/opre.21.1.343

Abstract

In this paper we show that a bounded integer programming problem, with real data, can be replaced with another problem of the same dimension, with rational data, in such a way that the feasible solutions and optimal feasible solutions to the new problem are identical with those to the original problem.

Enable JavaScript for citation tools and additional paper interactions.