Technical Note—Rationalizing Discrete Programs

Published Online:https://doi.org/10.1287/opre.21.1.343

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.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.