Separable convex programs with ratio constraints over a directed tree
From MaRDI portal
Recommendations
- Reducing Separable Convex Programs with Tree Constraints
- Minimisation d'une fonction convexe séparable avec contraintes de rapport entre les variables
- Solution of some convex separable resource allocation and production planning problems with bounds on the 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
Cites work
- scientific article; zbMATH DE number 3390139 (Why is no real title available?)
- A Network-Flow Algorithm for Project Selection
- Active set algorithms for isotonic regression; a unifying framework
- Additive structure in qualitative data: An alternating least squares method with optimal scaling features
- An algorithm for monotone regression with one or more independent variables
- Establishing Consistent and Realistic Reorder Intervals in Production-Distribution Systems
- Minimisation d'une fonction convexe séparable avec contraintes de rapport entre les variables
- Optimal and System Myopic Policies for Multi-Echelon Production/Inventory Assembly Systems
- The Problem of Negative Estimates of Variance Components
Cited in
(3)
This page was built for publication: Separable convex programs with ratio constraints over a directed tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1197894)
