A Linear Programming Approach to Sequential Hypothesis Testing
Under some mild Markov assumptions it is shown that the problem of designing optimal sequential tests for two simple hypotheses can be formulated as a linear program. This result is derived by investigating the Lagrangian dual of the sequential testing problem, which is an unconstrained optimal stop...
Saved in:
Published in | Sequential analysis Vol. 34; no. 2; pp. 235 - 263 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Philadelphia
Taylor & Francis Group
03.04.2015
Taylor & Francis Ltd |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!