Successive approximation in separable programming: An improved procedure for convex separable programs

DOI10.1002/nav.3800330213zbMath0596.90074OpenAlexW2095033782MaRDI QIDQ3730353

Lakshman S. Thakur

Publication date: 1986

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800330213

zbMATH Keywords

piecewise linear programsgeneral convex separable programs

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Methods of successive quadratic programming type (90C55)

Related Items (5)

A branch-and-bound approach for spare unit allocation in a series system ⋮ Optimal objective function approximation for separable convex quadratic programming ⋮ A MILP formulation for generalized geometric programming using piecewise-linear approximations ⋮ Sandwich approximation of univariate convex functions with an application to separable convex programming ⋮ Error analysis for convex separable programs: Bounds on optimal and dual optimal solutions

Cites Work

• Solving highly nonlinear convex separable programs using successive approximation

This page was built for publication: Successive approximation in separable programming: An improved procedure for convex separable programs