Approximation Of Separable Functions In Convex Programming
Jaromír Abrham, P. S. Arri · INFOR Information Systems and Operational Research · 1973
The purpose of this paper is to study polygonal approximations in separable convex programming, examine the related convergence problems, and obtain a lower and in some cases also an upper bound for the optimum value of the objective function in the original problem.