Computational aspects of two-segment separable programming

DOI10.1007/BF02591890MaRDI QIDQ3664835zbMATH OpenOpenAlexFDO

Authors Robert R. Meyer

Publication date 1983

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02591890

zbMATH Keywords

computation of lower boundscomputational comparisonserror boundslocal, two-segment approximationsnetwork optimizationpiecewise-linear approximationprimal and a dual approachrecursive separable programming algorithmsseparable convex programstest problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Convex programming (90C25) Programming involving graphs or networks (90C35) Methods of successive quadratic programming type (90C55)

Cites work

• A Class of Nonlinear Integer Programs Solvable by a Single Linear Program
• Computational aspects of two-segment separable programming
• Die Methode der „direkten Koeffizientenanpassung“ (μ-Form) des Separable Programming
• Dualität und Approximation bei konvexen Optimierungsproblemen
• Error Analysis for Convex Separable Programs: The Piecewise Linear Approximation and The Bounds on The Optimal Objective Value
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• scientific article; zbMATH DE number 3501238 (Why is no real title available?)
• scientific article; zbMATH DE number 3532745 (Why is no real title available?)
• Objective function approximations in mathematical programming
• On the Goldstein-Levitin-Polyak gradient projection method
• Secant approximation methods for convex optimization
• Solving the Pipe Network Analysis Problem Using Optimization Techniques
• Two-Segment Separable Programming

Cited in

(10)

• Global minimization of indefinite quadratic problems
• The empirical performance of a polynomial algorithm for constrained nonlinear optimization
• Optimal objective function approximation for separable convex quadratic programming
• A polynomial-time descent method for separable convex optimization problems with linear constraints
• Computational aspects of two-segment separable programming
• Reduction of nonlinear integer separable programming problems^∗
• Sandwich approximation of univariate convex functions with an application to separable convex programming
• Controlled predatory pricing in a multiperiod Stackelberg game: an MPEC approach
• Cross decomposition applied to the stochastic transportation problem
• Competitive facility location model with concave demand

This page was built for publication: Computational aspects of two-segment separable programming

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