In this article, we present an efficient descent method for locally Lipschitz continuous multiobjective optimization problems (MOPs). The is realized by combining a theoretical result regarding the computation of directions nonsmooth MOPs with practical to approximate subdifferentials objective functions. We show convergence points which satisfy necessary condition Pareto optimality. Using set ...