Separable convex programs with ratio constraints over a directed tree

DOI10.1016/0167-6377(92)90078-HzbMath0771.90080MaRDI QIDQ1197894

Christopher S. Tang, Carlton H. Scott

Publication date: 16 January 1993

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

regression analysisproduction planningdirected treeratio constraintsseparable convex programs

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90) Production models (90B30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Unnamed Item
• Active set algorithms for isotonic regression; a unifying framework
• Additive structure in qualitative data: An alternating least squares method with optimal scaling features
• A Network-Flow Algorithm for Project Selection
• Establishing Consistent and Realistic Reorder Intervals in Production-Distribution Systems
• The Problem of Negative Estimates of Variance Components
• Optimal and System Myopic Policies for Multi-Echelon Production/Inventory Assembly Systems
• Minimisation d'une fonction convexe séparable avec contraintes de rapport entre les variables
• An algorithm for monotone regression with one or more independent variables

This page was built for publication: Separable convex programs with ratio constraints over a directed tree