Minimization of a convex linear-fractional separable function subject to a convex inequality constraint or linear inequality constraint and bounds on the variables
From MaRDI portal
Publication:3428086
DOI10.1155/AMRX/2006/36581zbMATH Open1201.90159OpenAlexW1978874353MaRDI QIDQ3428086FDOQ3428086
Recommendations
- scientific article; zbMATH DE number 5270560
- Minimization of a strictly convex separable function subject to a convex inequality constraint or linear equality constraints and bounds on the variables
- Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints
- Convex separable minimization problems with a linear constraint and bounded variables
- Convex separable minimization subject to bounded variables
Cited In (16)
- Convex separable minimization problems with a linear constraint and bounded variables
- Solution of some convex separable resource allocation and production planning problems with bounds on the variables
- Estimation of optimum sample size allocation: an illustration with body mass index for evaluating the effect of a dietetic supplement
- Minimization of a strictly convex separable function subject to a convex inequality constraint or linear equality constraints and bounds on the variables
- Minimizing a linear fractional function subject to a system of sup-\(T\) equations with a continuous Archimedean triangular norm
- Numerical solution of optimal allocation problems in stratified sampling under box constraints
- On the solution of multidimensional convex separable continuous knapsack problem with bounded variables
- Branch and bound computation of the minimum norm of a linear fractional transformation over a structured set
- 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
- Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables
- Separable convex programs with ratio constraints over a directed tree
- Well-posedness and primal-dual analysis of some convex separable optimization problems
- Maximin Problem and a Duality Theorem for Mixed‐Integer Quadratic Programming
- 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 no real title available?)
This page was built for publication: Minimization of a convex linear-fractional separable function subject to a convex inequality constraint or linear inequality constraint and bounds on the variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3428086)
