The assumed global optimum solution obtained in linear programming is not an assumed characteristic of separable linear programming. Separable programming is non-linear programming and must possess certain sufficient conditions for a global optimum to be obtained. The global optimum conditions for separable programming are set forth.