For an extended Hamming code, we establish two binary integer linear program problems, the optima of which give lower and upper bounds on the second/third separating redundancy of the code. Numerical ...