Benders' decomposition for the constrained \(\ell_ 1\)-problem
type: Item
instance of: scholarly article
title: Benders' decomposition for the constrained \(\ell_ 1\)-problem
zbMATH Open document ID: 0696.90049
DOI: 10.1007/BF00941565
author: N. E. Zubov
published in: Journal of Optimization Theory and Applications
publication date: 1991-01-01T00:00:00Z
review text: A constrained \(\ell_ 1\)-problem, involving linear functions only, is considered, and the application of the Benders decomposition method to the solution of the same is discussed. This approach, in principle, seems to be promising and is also applicable to the unconstrained case. Certain small illustrative examples are also presented.
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 49M27
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 4141798
zbMATH Keywords: constrained \(\ell ^ 1\)-problem
zbMATH Keywords: Benders decomposition
MaRDI profile type: Publication
cites work: Q3703599
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Q5630824
cites work: The Cutting-Plane Method for Solving Convex Programs
full work available at URL: https://doi.org/10.1007/bf00941565
OpenAlex ID: W2277641656
description: scientific article; zbMATH DE number 4141798