The techniques of linear programming have been applied to the synthesis of optimum directional patterns from arrays of point elements. A practical linear model of the problem can be formulated by dealing with the real and imaginary components of the directivity function. The size and geometry of arrays that can be treated by this approach are limited only by computation time and computer storage requirements. Numerical examples are given for arrays of up to 70 elements.