Abstract
Symbolic logic can be used to translate verbal statements of the optimization problem into an exact mathematical form. There are then three stages in the problem formulation—the verbal stage, the logical stage and the mathematical stage. The purpose of this paper is to translate statements of symbolic logic into the language of zero-one linear programming. Concepts of symbolic logic and zero-one linear programming will be described with examples of translating verbal statements into symbolic logic, and of translating logical statements into a mathematically equivalent form.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G. Hadley:Nonlinear and Dynamic Programming, Addison-Wesley Publishing Company Inc., 1964.
G. B. Danzig:Linear Programming and Extensions, Princeton University Press, 1963.
D. Hilbert und W. Ackermann:Grundzüge der theoretischen Logik, Springer-Verlag, 1949.
E. L. Lawler and D. E. Wood:Branch-and-Bound Methods: A Survey, Operations Research, Vol. 14 (July–Aug. 1966) pp. 699–719.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Seppälä, Y. Translating statements of symbolic logic into zero-one linear programming. BIT 8, 310–327 (1968). https://doi.org/10.1007/BF01933441
Issue Date:
DOI: https://doi.org/10.1007/BF01933441