In this paper we present a new approach for solving a class of separated continuous programming (SCP) problems using convex combination property of intervals. By convex combination property of intervals, we transform the SCP problems to the corresponding linear problems. Moreover, discretization method is applied to convert the new problem to a discrete-time problem which we solve it by linear programming methods. Finally, some numerical examples are given to show the efficiency of the proposed approach.

Keywords