Computational aspects of two-segment separable programming
- 1 May 1983
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 26 (1) , 21-39
- https://doi.org/10.1007/bf02591890
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Secant approximation methods for convex optimizationPublished by Springer Nature ,1981
- 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
- Solving the Pipe Network Analysis Problem Using Optimization TechniquesManagement Science, 1978
- Objective function approximations in mathematical programmingMathematical Programming, 1977
- A Class of Nonlinear Integer Programs Solvable by a Single Linear ProgramSIAM Journal on Control and Optimization, 1977
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment AlgorithmsManagement Science, 1977
- On the Goldstein-Levitin-Polyak gradient projection methodIEEE Transactions on Automatic Control, 1976