41 Counterexamples to Property (B) of the Discrete Time Bomber Problem

Takashi Kamihigashi

No DP2016-23, Discussion Paper Series from Research Institute for Economics & Business Administration, Kobe University

Abstract: 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 (GMP) Arithmetic Library. All our counterexamples can readily be verified using a simple Mathematica program included in this paper.

Keywords: The discrete time bomber problem; Error-free methods; GNU Multiple Precision (GMP) Arithmetic Library; Stochastic dynamic programming (search for similar items in EconPapers)
Pages: 15 pages
Date: 2016-06
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.rieb.kobe-u.ac.jp/academic/ra/dp/English/DP2016-23.pdf First version, 2016 (application/pdf)

Related works:
Journal Article: 41 Counterexamples to property (B) of the discrete time bomber problem (2017)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:kob:dpaper:dp2016-23

Access Statistics for this paper

More papers in Discussion Paper Series from Research Institute for Economics & Business Administration, Kobe University 2-1 Rokkodai, Nada, Kobe 657-8501 JAPAN. Contact information at EDIRC.
Bibliographic data for series maintained by Office of Promoting Research Collaboration, Research Institute for Economics & Business Administration, Kobe University ().