Analysis and solution of discrete optimization problems with logical constraints on the base of $L$-partition approach

In the paper, we analize discrete optimization problems with logical constraints based on integer linear programming models and $L$-partition approach. We obtain an upper bound for the power of any $L$-complex of the $2$-SAT polytope. The use of this evaluation allows to solve some applied problems of designing complex products by these approaches much more efficiently.