👉 Few questions covered:

1.what is Separable Programming ?

2.what is Separable functions ?

3.what is convex functions ?

4.what is convex programming ?

About Separable Programming:

Separable programming is deal with such non linear programming problems in which the objective function as well as all the constraints are separable. In the decisions making situations the non linear profit or cost functions are related by relatively smooth curves rather than sharp curves. Thus breaking point are obtained on such curves. In such cases the non linear objective function with a smooth curve for it , may be approximated by a series of piece wise linear segments. This approximation will introduce some error may be negligibly small in many cases. Such error can be reduced much by increasing the number of linear segments .Piece wise linear approximation can be done for convex as well concave functions.