An algorithm for the mixed integer problem.
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.
- Copyright: RAND Corporation
- Availability: Available
- Print Format: Paperback
- List Price: $20.00
- Paperback Price: $16.00
- Document Number: RM-2597-PR
- Year: 1960
- Series: Research Memoranda
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.
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.