Premium
A Note on “Discrete Sequential Search with Group Activities”
Author(s) -
Talla Nobibon Fabrice,
Coolen Kris,
Leus Roel
Publication year - 2013
Publication title -
decision sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.238
H-Index - 108
eISSN - 1540-5915
pISSN - 0011-7315
DOI - 10.1111/deci.12010
Subject(s) - counterexample , conjecture , integer programming , integer (computer science) , linear programming , group (periodic table) , value (mathematics) , mathematics , computer science , mathematical economics , mathematical optimization , discrete mathematics , statistics , programming language , chemistry , organic chemistry
This note comments on a paper published by Wagner and Davis [ Decision Sciences (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.