Error bounds for the aggregated convex programming problem

DOI10.1007/BF02591896zbMath0516.90060MaRDI QIDQ3664837

Gur Huberman

Publication date: 1983

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

error boundslarge-scale problemconvex differentiable functionsvariable aggregationconvex cost transportationoptimal objective function valuesproblem reduction by aggregated variables estimation

Mathematics Subject Classification ID

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

Related Items (1)

Improving aggregation bounds for two-stage stochastic programs

Cites Work

• Unnamed Item
• Bounds on the Effect of Aggregating Variables in Linear Programs
• Bounds for aggregating nodes in network problems
• A priori error bounds for procurement commodity aggregation in logistics planning models
• The decomposition of nonlinear problems

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