An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint
From MaRDI portal
Publication:2491532
DOI10.1155/JAMDS/2006/89307zbMath1138.90443OpenAlexW1991014844MaRDI QIDQ2491532
Publication date: 29 May 2006
Published in: Journal of Applied Mathematics and Decision Sciences (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/129014
Related Items (3)
On the solution of multidimensional convex separable continuous knapsack problem with bounded variables ⋮ Well-posedness and primal-dual analysis of some convex separable optimization problems ⋮ Optimisation-Based Overload Control
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex separable minimization problems with a linear constraint and bounded variables
- 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
- A Polynomial Time Algorithm for the Resource Allocation Problem with a Convex Objective Function
- Convex separable minimization subject to bounded variables
- Separable programming. Theory and methods
This page was built for publication: An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint
