We describe a generalization of the
level method for solving a nondifferentiable program where the problem data
(feasible set, functionvalues, and subgradients) are not known explicitely and may be
approximated using an oracle only up to an appropriately chosen accuracy.
We show that it produces an approximately feasible and optimal
solution after a finite number of oracle calls.