Successive approximation in separable programming: An improved procedure for convex separable programs
- 1 May 1986
- journal article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 33 (2) , 325-358
- https://doi.org/10.1002/nav.3800330213
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- An ellipsoid algorithm for nonlinear programmingMathematical Programming, 1983
- Error analysis for convex separable programs: Bounds on optimal and dual optimal solutionsJournal of Mathematical Analysis and Applications, 1980
- Nonlinear Programming CodesPublished by Springer Nature ,1980
- Two-Segment Separable ProgrammingManagement Science, 1979
- Error Analysis for Convex Separable Programs: The Piecewise Linear Approximation and The Bounds on The Optimal Objective ValueSIAM Journal on Applied Mathematics, 1978
- Global Minimization in Nonconvex All-Quadratic ProgrammingManagement Science, 1975
- Programming Under Uncertainty: The Equivalent Convex ProgramSIAM Journal on Applied Mathematics, 1966