A Note on "Discrete Sequential Search with Group Activities". Issue 2 (12th April 2013)

• Record Type: Journal Article
• Authors: Talla Nobibon, Fabrice; Coolen, Kris; Leus, Roel
• Is Part Of: Decision sciences. Volume 44:Issue 2(2013)
• Page Start: 395
• Page End: 401
• Publication Date: 2013-04-12
• Subjects: Decision making -- Periodicals; Policy sciences -- Periodicals; 658.40305
• DOI: 10.1111/deci.12010
• Languages: English
• ISSNs: 0011-7315

Abstract

<abstract abstract-type="main"> <title>ABSTRACT</title> <p>This note comments on a paper published by Wagner and Davis [<italic>Decision Sciences</italic> (2001), 32(4), 557–573]. These authors present an integer‐programming model for the single‐item discrete sequential search problem with group activities. Based on their experiments, they conjecture that the problem can be solved as a linear program. In this note, we provide a counterexample for which the optimal value of the linear program they propose is different from the optimal value of the integer‐programming model, hence contradicting their conjecture for the specific linear program that they specify. To the best of our knowledge, the conjecture settled in this note was still an open question.</p> </abstract>