A convergent algorithm for l(1) robust identification of a stable rational transfer function with known order is proposed, which is implemented by solving a linear programming problem and can produce a rational transfer function with a fixed order. An explicit upper hound on its worst case identification error is given. Its performance is proven to be close to that of an interpolatory algorithm if a high-order Galois sequence is taken as the input signal.