The development of a variant to a recent result of Gomory (Princeton). In solving linear programs in integers, Gomory showed how to add linear inequality constraints to a linear-programming problem automatically in such a way that the extreme points of the resulting convex contain only integral solutions in the neighborhood of the minimum. The present study gives an alternative method for generating additional constraints in a way easy to justify and apply. It is not known, however, whether these conditions will lead to a solution in a finite number of iterations as is true for the stronger Gomory conditions. Anyone considering their practical use should therefore weigh the ease of generation against the extra number of iterations required for convergence.
This report is part of the RAND Corporation Research memorandum series. The Research Memorandum was a product of the RAND Corporation from 1948 to 1973 that represented working papers meant to report current results of RAND research to appropriate audiences.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.