Abstract
Consider the problem of finding the minimum value of a scalar objective function whose arguments are theN components of 2N vector elements partially ordered as a Boolean lattice. If the function is strictly decreasing along any shortest path from the minimum point to its logical complement, then the minimum can be located precisely after sequential measurement of the objective function atN + 1 points. This result suggests a new line of research on discrete optimization problems.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
B.H. Arnold,Logic and Boolean algebra (New York, Springer-Verlag, 1962).
P.L. Hammer, I. Rosenberg and S. Rudeanu, “Application of discrete linear programming to the minimization of Boolean functions (in Russian).”Revues Mathematiques Pures et Appliqués 8 (1963) 459–475.
P.L. Hammer and S. Rudeanu,Boolean methods in operations research (New York, Springer-Verlag 1968) pp. 122–5.
J. Kiefer, “Sequential minimax search for a maximum,”Proceedings of the American Mathematical Society 4 (1953) 502–6.
D.J. Wilde and C.S. Beightler,Foundations of optimization (Englewood Cliffs, N.J., Prentice-Hall Inc., 1967) Ch. 6.
D.J. Wilde and J.M. Sanchez-Anton, “Multivariable monotonic optimization over multivalued logics and rectangular design lattices,” to appear inDiscrete Mathematics.
Author information
Authors and Affiliations
Additional information
This research was supported in part by U.S. Office of Saline Water Grant No. 699.
Rights and permissions
About this article
Cite this article
Wilde, D.J., Sanchez-Anton, J.M. Discrete optimization on a multivariable boolean lattice. Mathematical Programming 1, 301–306 (1971). https://doi.org/10.1007/BF01584094
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01584094