Approximation Of Separable Functions In Convex Programming
- 1 October 1973
- journal article
- research article
- Published by Taylor & Francis in INFOR: Information Systems and Operational Research
- Vol. 11 (3) , 245-252
- https://doi.org/10.1080/03155986.1973.11731554
Abstract
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.Keywords
This publication has 3 references indexed in Scilit:
- An Application of Separable ProgrammingThe Computer Journal, 1966
- Separable Programming Applied to an Ore Purchasing ProblemJournal of the Royal Statistical Society Series C: Applied Statistics, 1965
- Nonlinear Programming by the Simplex MethodEconometrica, 1961