The discrete time “bomber problem” has been one of the longest standing open problems in operations research. In particular, the validity of one of the natural monotonicity conjectures—known as property (B)—has been an unresolved issue since 1968. In this paper we report 41 counterexamples to property (B) of this problem. We have found them by computing the exact solutions for nearly one million pairs of parameter values utilizing the GNU multiple precision arithmetic library. All our counterexamples can readily be verified using a simple Mathematica program included in this paper.
For the newest resources, visit Wolfram Repositories and Archives »
