Two-Segment Separable Programming

DOI10.1287/mnsc.25.4.385zbMath0415.90068OpenAlexW2034306657MaRDI QIDQ3205029

Robert R. Meyer

Publication date: 1979

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: http://digital.library.wisc.edu/1793/58082

zbMATH Keywords

convex programmingrapid convergencepiecewise-linear approximationsnumerical experiencenonlinear networksconvex separable functionsiterative separable programming techniqueslocal two-segment

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Convex programming (90C25) Integer programming (90C10) Nonlinear programming (90C30)

Related Items

Optimal objective function approximation for separable convex quadratic programming, Solving highly nonlinear convex separable programs using successive approximation, A two-segment approximation algorithm for separable convex programming with linear constraints, Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions, Competitive facility location model with concave demand, Mean‐standard deviation model for minimum cost flow problem, On large scale nonlinear network optimization, A piecewise linear approximation procedure forL_pnorm curve fitting, Controlled predatory pricing in a multiperiod Stackelberg game: an MPEC approach, On the Derivation of Continuous Piecewise Linear Approximating Functions, Computational aspects of two-segment separable programming, A global optimization method for nonconvex separable programming problems, Performance evaluation of independent superbasic sets on nonlinear replicated networks