On an optimal solution for maximizing the probability of retention in PPS sampling

A direct alternative proof of Keyfitz's optimal solution to the problem of maximizing the probability of retention in sampling on a second occasion is given, using techniques of elementary linear algebra. The proof and comments help one to better understand Keyfitz's solution, and they clearly demonstrate that the closed form solution of Keyfitz is one of a possible infinity of solutions offered by a linear programming approach. We also give one of those other solutions offered by linear programming, which is easy to obtain by hand calculations using only the operation of subtraction.