Solution of Variable Separable Programming

To reduce a mass of calculations with solving multiple constraints for variable programming, The variable separable programming was transformed into a problem with single constraint by using coherency function. The engineering problem of multiple constraints and multi-objective condensed into a approximation and control by approximation precision parameter, to solve the original problem and analyses the variable separable objective function \sum\limits_i=1^n f_i\left(x_i\right) and KS (ρ, x) constructed as L (x, λ) functions. Its saddle point condition is obtained in terms of the Lagrange multiplier method. Then by mean of utilizing Taylor formula, the condition is expanded to an approximate equation. Some numerical experiments show that the proposed algorithm is feasible.