Modified Gauss Elimination Technique for Separable Nonlinear Programming Problem

Separable programming deals with such nonlinear programming problem in which theobjective function as well as constraints are separable. for solving separable nonlinearprogramming problem (snpp) is reduced first to linear programming problem (lpp)by approximating each separable function by a piecewise linear function and than usualgraphical, simplex method applied. a new form of gauss elimination technique for inequalitieshas been proposed for solving a separable nonlinear programming problem.the technique is useful than the earlier existing methods because it takes least time andcalculations involve in are also simple. the same has been illustrated by a numericalexample of snpp.