Abstract
We examine a sequential selection problem in which a single option must be selected. Each option's value is a function of its attributes, whose precise values can be ascertained at a given cost. We prove the optimality of a threshold stopping rule for a general class of objective functions.
Original language | English (US) |
---|---|
Pages (from-to) | 324-330 |
Number of pages | 7 |
Journal | Operations Research Letters |
Volume | 35 |
Issue number | 3 |
DOIs | |
State | Published - May 2007 |
Externally published | Yes |
Keywords
- Dynamic programming
- Multi-attribute optimization
- Sequential search
ASJC Scopus subject areas
- Software
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics