Notes on Linear Programming

Part XLVII Solving Linear Programs in Integers

by George Bernard Dantzig


Download Free Electronic Document

FormatFile SizeNotes
PDF file 0.7 MB

Use Adobe Acrobat Reader version 10 or higher for the best experience.


Purchase Print Copy

 FormatList Price Price
Add to Cart Paperback12 pages $20.00 $16.00 20% Web Discount

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.

Permission is given to duplicate this electronic document for personal use only, as long as it is unaltered and complete. Copies may not be duplicated for commercial purposes. Unauthorized posting of RAND PDFs to a non-RAND Web site is prohibited. RAND PDFs are protected under copyright law. For information on reprint and linking permissions, please visit the RAND Permissions page.

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.