A variant of Tuy's decomposition algorithm for solving a class of concave minimization problems

DOI10.1080/02331939108843702zbMath0734.90091OpenAlexW2060327490MaRDI QIDQ3363075

Tran Vu Thieu

Publication date: 1991

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939108843702

zbMATH Keywords

concave minimizationspecial linear constraintsTuy's decomposition

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Decomposition methods (49M27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Concave minimization under linear constraints with special structure
• Global minimization of large-scale constrained concave quadratic problems by separable programming
• A Successive Underestimation Method for Concave Minimization Problems

This page was built for publication: A variant of Tuy's decomposition algorithm for solving a class of concave minimization problems