Reducing Separable Convex Programs with Tree Constraints

DOI10.1287/mnsc.36.11.1407zbMath0727.90060OpenAlexW2048696888MaRDI QIDQ3351145

Christopher S. Tang

Publication date: 1990

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.36.11.1407

zbMATH Keywords

tree constraintsseparable convex programs

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Production models (90B30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Inverse optimization for linearly constrained convex separable programming problems