Error bounds for the aggregated convex programming problem

DOI10.1007/BF02591896MaRDI QIDQ3664837zbMATH OpenFDO

Authors Gur Huberman

Publication date 1983

Published in Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

convex cost transportationconvex differentiable functionserror boundslarge-scale problemoptimal objective function valuesproblem reduction by aggregated variables estimationvariable aggregation

Mathematics Subject Classification ID

Numerical methods involving duality (49M29) Error analysis and interval analysis (65G99) Numerical mathematical programming methods (65K05) Boolean programming (90C09) Convex programming (90C25) Methods of successive quadratic programming type (90C55)

Cites work

• A priori error bounds for procurement commodity aggregation in logistics planning models
• Bounds for aggregating nodes in network problems
• Bounds on the Effect of Aggregating Variables in Linear Programs
• scientific article; zbMATH DE number 3562783 (Why is no real title available?)
• The decomposition of nonlinear problems

Cited in

(1)

• Improving aggregation bounds for two-stage stochastic programs

This page was built for publication: Error bounds for the aggregated convex programming problem

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