Weakly determinate problems of Boolean linear programming with a partially specified set of admissible solutions

Weakly determinate problems of Boolean programming comprise those in which the objective function or set of admissible solutions is partially but not completely specified. Using the properties of the monotonic Boolean functions which correspond to the constraints of the Boolean linear programming problems, an approach is given for constructing a complete definition of the partially specified set of admissible solutions, and for finding the optimal solutions in the completed definition. To check that the solutions obtained are admissible, a recognition algorithm for the class of admissible solutions is employed.