Convex separable minimization problems with a linear constraint and bounded variables
From MaRDI portal
Publication:2575941
DOI10.1155/IJMMS.2005.1339zbMath1111.90086OpenAlexW2022482495MaRDI QIDQ2575941
Publication date: 7 December 2005
Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/53101
Related Items (6)
Probabilistic solutions for a class of deterministic optimal allocation problems ⋮ Well-posedness and primal-dual analysis of some convex separable optimization problems ⋮ Solution of some convex separable resource allocation and production planning problems with bounds on the variables ⋮ Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints ⋮ An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint ⋮ A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph
This page was built for publication: Convex separable minimization problems with a linear constraint and bounded variables
