Minimisation d'une fonction convexe séparable avec contraintes de rapport entre les variables

DOI10.1051/RO/1989230403051MaRDI QIDQ4733669zbMATH OpenOpenAlexFDO

Authors Yvan Dumas, Jacques Desrosiers, François Soumis

Publication date 1989

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/104966

zbMATH Keywords

dual algorithmdiscrete regressionratio constraintsseparable convex function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Recommendations

• Minimization of a convex linear-fractional separable function subject to a convex inequality constraint or linear inequality constraint and bounds on the variables
• Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints
• Separable convex programs with ratio constraints over a directed tree
• Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables
• Convex separable minimization subject to bounded variables

Cited in

(1)

• Separable convex programs with ratio constraints over a directed tree

This page was built for publication: Minimisation d'une fonction convexe séparable avec contraintes de rapport entre les variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4733669)