A Simplex Method for a Class of Nonconvex Separable Problems

In this paper we present an extension of the simplex procedure to deal with separable programming problems where the objective is composed of functions which are either convex or concave and where the feasible solution set is convex.