Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables

DOI10.1080/09720502.2006.10700438zbMath1137.90641OpenAlexW2101166808MaRDI QIDQ3445459

Stefan M. Stefanov

Publication date: 11 June 2007

Published in: Journal of Interdisciplinary Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

exponential functioncomputational complexityconvex programmingseparable programmingpolynomial algorithms

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (2)

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

Cites Work

• Convex quadratic programming with one constraint and bounded variables
• Simple Ranking Methods for Allocation of One Resource
• A polynomially bounded algorithm for a singly constrained quadratic program
• Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
• Technical Note—Allocation of Effort Resources among Competing Activities
• Convex separable minimization subject to bounded variables

This page was built for publication: Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables