On the Fundamental Lemma of Neyman and Pearson
From MaRDI portal
Publication:5803680
DOI10.1214/aoms/1177729695zbMath0042.14301OpenAlexW2065218675WikidataQ56049006 ScholiaQ56049006MaRDI QIDQ5803680
Publication date: 1951
Published in: The Annals of Mathematical Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoms/1177729695
Related Items (26)
Oil minmax programming problems containing n-set functions ⋮ Unnamed Item ⋮ The saddle theorem for multiobjective generalized fractional programming problems with set functions ⋮ An algorithm of solution of a multiproduct problem of optimal partitioning with constraints ⋮ A general characterization of optimal tie-breaker designs ⋮ Sufficiency in multiobjective subset programming involving generalized type-I functions ⋮ On optimality and duality for multiobjective programming problems involving generalized \(d\)-type-I and related \(n\)-set functions. ⋮ Sharp Sensitivity Analysis for Inverse Propensity Weighting via Quantile Balancing ⋮ On locally optimal invariant unbiased tests for the variance components ratio in mixed linear models ⋮ On a general duality model in multiobjective fractional programming with \(n\)-set functions ⋮ On the definition of a concentration function relevant to the ROC curve ⋮ Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions ⋮ On the optimality of differentiable nonconvex \(n\)-set functions ⋮ Optimality conditions and duality for multiobjective measurable subset selection problems ⋮ Randpunkte des Wertebereiches allgemeiner Vektormaße ohne Sprünge ⋮ Some duality relationships for the generalized Neyman-Pearson problem ⋮ Optimization theory for n-set functions ⋮ Sufficiency criteria and duality for nonlinear programs involving n-set functions ⋮ On the existence of least favorable contents ⋮ Efficiency in integral facility design problems ⋮ Optimality for nonlinear programs containingn-set functions ⋮ Duality relationships for a nonlinear version of the generalized Neyman- Pearson problem ⋮ On sharpness of Tchebycheff-type inequalities ⋮ Discrete decision problems ⋮ Unnamed Item ⋮ George B. Dantzig: a legendary life in mathematical programming
This page was built for publication: On the Fundamental Lemma of Neyman and Pearson
