Abstract
The paper presents a method to solve systems of linear equations with Boolean variables, which implements an enumeration strategy. Necessary and sufficient conditions for the existence of feasible plans are formalized. A formal procedure to analyze subsets of alternatives is described. The structure of an algorithm that possesses the property of completeness is presented. Special cases of systems of equations are examined.
Similar content being viewed by others
References
V. S. Mikhalevich and V. L. Volkovich, Computational Methods of the Analysis and Design of Complex Systems [in Russian], Nauka, Moscow (1982).
C. H. Papadimitriu and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall (1987).
V. E. Obukhov and V. V. Pavlov, Logical Equations and Applied Problems [in Russian], Naukova Dumka, Kyiv (1992).
V. S. Mikhalevich, “Sequential optimization algorithms and their application. Pt. I, II,” Cybernetics, No. 1, 45–56; No. 2, 85–89 (1965).
O. Litvinenko, G. S. Kralina, and O. P. Styopushkin, “Mathematical model of syllabus scheduling problems,” Visnyk NAU, No. 1, 180–186 (2004).
O. E. Litvinenko, “Mathematical method for failure detection in complex engineering systems,” Visnyk NAU, No. 4, 143–150 (2002).
A. E. Litvinenko, S. A. Dmitriev, E. P. Stepushkina, and A. V. Popov, “Expert models of detecting multiple failures in aircraft engines,” Vestnik Dvigatelestroeniya, No. 1, 67–77 (2005).
Author information
Authors and Affiliations
Additional information
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 42–50, September–October 2006.
Rights and permissions
About this article
Cite this article
Litvinenko, A.E. Solving systems of linear equations with Boolean variables. Cybern Syst Anal 42, 649–655 (2006). https://doi.org/10.1007/s10559-006-0102-7
Received:
Issue Date:
DOI: https://doi.org/10.1007/s10559-006-0102-7