The weighted Chebyshev design of two-dimensional FIR filters is in general not unique since the Haar condition is not generally satisfied. However, fo r a design on a discrete frequency domain, the Haar condition might be fulf illed. The question of uniqueness is, however, rather extensive to investig ate. It is therefore desirable to define some simple additional constraints to the Chebyshev design in order to obtain a unique solution. The weighted Chebyshev solution of minimum Euclidean filter weight norm is always uniqu e, and represents a sensible additional constraint since it implies minimum white noise amplification. This unique Chebyshev solution can always be ob tained by using an efficient quadratic programming formulation with a stric tly convex objective function and linear constraints. An example where a co nventional Chebyshev solution is nonunique is discussed in the brief.