Some optimization problems in selection procedures
Wentao Huang · Journal of Statistical Computation and Simulation · 1985
Two algorithms are proposed for computing the exact values of some constants in the well-known binomial subset selection procedures. Some necessary and sufficient conditions that the worst configuration occurs at are given. Two counter examples to a conjecture are also shown.