PMF feasibility beyond the sampled proposal pool

Determine whether the Chicago-Hardship PMF requirements are feasible over the complete set of possible blocks, rather than only within the sparse sampled proposal pool.

Background

For Chicago-Hardship, the generated proposal pool contained only 34 blocks, of which one satisfied the group-mean access threshold. The inclusion floors required at least 42 blocks overall and 48 for the most restrictive group, so the optimization problem was infeasible within that sampled pool.

The authors explicitly limit this conclusion to the sparse proposal pool and state that they did not test feasibility over the complete set of possible blocks. Thus, it remains unresolved whether the PMF constraints are intrinsically infeasible or merely unsupported by the sampled proposal pool.