An algorithm for the mixed integer problem.

Ralph Edward Gomory

ResearchPublished 1960

An algorithm for the numerical solution of the "mixed integer" linear-programming problem in a finite number of variables. In problems of this type, the variables are constrained by linear inequalities and by the requirement that certain of the variables assume only integral values. The algorithm is an extension of the cutting plane technique for the solution of the "pure integer" problem.

Document Details

  • Copyright: RAND Corporation
  • Availability: Web Only
  • Year: 1960
  • Document Number: RM-2597

Citation

Chicago Manual of Style

Gomory, Ralph Edward, An algorithm for the mixed integer problem. Santa Monica, CA: RAND Corporation, 1960. https://www.rand.org/pubs/research_memoranda/RM2597.html.
BibTeX RIS

This publication is part of the RAND research memorandum series. The research memorandum series, a product of RAND from 1948 to 1973, included 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.

RAND 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.