An Algorithm for Solving Mixed Integer Linear Programmes
Journal of the Operational Research SocietyPublished 1 June 1964
Paula M. J. Harris
Citations11
SJR quartileQ1
SJR score0.92
SNIP1.26
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A simplified form of an algorithm for solving mixed integer linear programmes is presented by considering the geometry of the problem and the ideas developed are translated into algebra.
Abstract
A simplified form of an algorithm for solving mixed integer linear programmes is presented. It is introduced by considering the geometry of the problem, from which most of the terminology originates. The ideas developed are then translated into algebra. A simple logical flow diagram is presented and its use illustrated by a worked example. An appendix covers the more important refinements.
Keywords
MathematicsEngineering