Benders' decomposition for the constrained \(\ell_ 1\)-problem

DOI10.1007/BF00941565zbMath0696.90049OpenAlexW2277641656MaRDI QIDQ911464

N. E. Zubov

Publication date: 1991

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

Benders decompositionconstrained \(\ell ^ 1\)-problem

Mathematics Subject Classification ID

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

Related Items (1)

Generalized Benders Decomposition for one Class of MINLPs with Vector Conic Constraint

Cites Work

• Partitioning procedures for solving mixed-variables programming problems
• The Cutting-Plane Method for Solving Convex Programs
• Unnamed Item
• Unnamed Item

This page was built for publication: Benders' decomposition for the constrained \(\ell_ 1\)-problem