Two-Segment Separable Programming

DOI10.1287/MNSC.25.4.385zbMATH Open0415.90068OpenAlexW2034306657MaRDI QIDQ3205029FDOQ3205029

Authors: 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 programmingnumerical experiencerapid convergencenonlinear networkspiecewise-linear approximationsconvex separable functionsiterative separable programming techniqueslocal two-segment

Mathematics Subject Classification ID

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

Cited In (13)

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

This page was built for publication: Two-Segment Separable Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3205029)