ISSN:
1436-4646
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract Consider the problem of finding the minimum value of a scalar objective function whose arguments are theN components of 2 N 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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01584094