Reducing Separable Convex Programs with Tree Constraints

DOI10.1287/MNSC.36.11.1407MaRDI QIDQ3351145zbMATH OpenOpenAlexFDO

Authors 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

separable convex programstree constraints

Mathematics Subject Classification ID

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

Recommendations

• Separable convex programs with ratio constraints over a directed tree
• Minimizing Separable Convex Objectives on Arbitrarily Directed Trees of Variable Upper Bound Constraints
• Tree-sparse convex programs
• Treewidth reduction for constrained separation and bipartization problems
• scientific article; zbMATH DE number 2146951
• Reformulations for utilizing separability when solving convex MINLP problems
• Properties of tree convex constraints
• Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint
• scientific article; zbMATH DE number 3858863

Cited in

(3)

• Inverse optimization for linearly constrained convex separable programming problems
• Separable convex programs with ratio constraints over a directed tree
• Tree-sparse convex programs

This page was built for publication: Reducing Separable Convex Programs with Tree Constraints

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