Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Abrham et al. (1973) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: