In the past, the

deconvolution problem, for an integer

other than 1, 2 and 0, has been solved by nonlinear optimization techniques which are in general complicated and computationally not very efficient. In the present paper, we introduce a new method which reduces the

deconvolution problem, for an arbitrary

, to a linear programming problem which is then solved by means of a new modification of the simplex algorithm.