Abstract
We propose a new technique based on symbolic transformation of a system of logical constraints into a so-called singular parenthesized form and develop efficient numerical methods for contraction of the parenthesized form. A solution example is given and the results of program experiments are reported.
Similar content being viewed by others
Literature Cited
V. P. Sigorskii, Mathematics for Engineers [in Russian], Tekhnika, Kiev (1977).
G. I. Ankudinov, Structural Design of Complex Objects: Logical-Combinatorial Approach [in Russian], Leningrad State Univ. (1986).
G. I. Ankudinov, “On one general approach to structural design of algorithms, devices, and systems,” Kibernetika, No. 1, 55–68 (1982).
V. S. Mikhalevich and V. L. Volkovich, Computational Methods of Analysis and Design of Complex Systems [in Russian], Nauka, Moscow (1982).
V. L. Volkovich, A. F. Voloshin, T. M. Gorlova, et al., Methods and Algorithms for Computer-Aided Design of Complex Control Systems [in Russian], Naukova Dumka, Kiev (1984).
Additional information
Translated from Kibernetika, No. 3, pp. 51–55, May–June, 1989.
Rights and permissions
About this article
Cite this article
Ankudinov, G.I. Symbolic-numerical methods in discrete programming problems with logical constraints. Cybern Syst Anal 25, 347–353 (1989). https://doi.org/10.1007/BF01069990
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01069990