Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables
From MaRDI portal
Publication:3445459
DOI10.1080/09720502.2006.10700438zbMATH Open1137.90641OpenAlexW2101166808MaRDI QIDQ3445459FDOQ3445459
Authors: S. 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
Recommendations
- Minimization of a strictly convex separable function subject to a convex inequality constraint or linear equality constraints and bounds on the variables
- scientific article; zbMATH DE number 5270560
- Convex separable minimization problems with a linear constraint and bounded variables
- Minimization of a convex linear-fractional separable function subject to a convex inequality constraint or linear inequality constraint and bounds on the variables
- An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint
exponential functioncomputational complexityconvex programmingpolynomial algorithmsseparable programming
Cites Work
- A polynomially bounded algorithm for a singly constrained quadratic program
- Convex quadratic programming with one constraint and bounded variables
- Simple Ranking Methods for Allocation of One Resource
- 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
Cited In (6)
- 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
- Minimisation d'une fonction convexe séparable avec contraintes de rapport entre les variables
- Reduction of a Minimization Problem of a Separable Convex Function Under Linear Constraints to a Fixed Point Problem
- An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint
- Title not available (Why is that?)
This page was built for publication: Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3445459)
