This is the authors' abstract. We don't add key points for this paper.
I n the classical linear programming problem the behaviour of continuous, nonnegative variables subject to a system of linear inequalities is investigated.One possible generalization of this problem is to relax the continuity condition on the variables.This paper presents a simple numerical algorithm for the solution of programming problems in which some or all of the variables can take only discrete values.The algorithm requires no special techniques beyond those used in ordinary linear programming, and lends itself to automatic computing.Its use is illustrated on two ~lumerical examples.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Land et al. (1960) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: