It is shown that a piecewise linear continuous function of one variable can be easily written as a sum of piecewise linear concave and convex functions of that variable. Using this fact the problem of minimizing a separable piecewise linear continuous function of n variables subject to convex constraints of the same type is transformed into a concave minimization problem subject to linear constraints. A finite cutting plane method is proposed to solve the later problem.