| 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.
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 42–50, September–October 2006. |
