Partial decoding of monotonic Boolean functions

The problem of seeking the lexicographically greatest zero and the problem of partial decoding, including the search for the maximum upper zero, are solved in Shannon's statement for monotonic Boolean functions. The results are used to estimate the complexity of the solution of some problems of combinatorial optimization.