Minimization of a convex linear-fractional separable function subject to a convex inequality constraint or linear inequality constraint and bounds on the variables

DOI10.1155/AMRX/2006/36581zbMath1201.90159OpenAlexW1978874353MaRDI QIDQ3428086

Stefan M. Stefanov

Publication date: 27 March 2007

Published in: Applied Mathematics Research eXpress (Search for Journal in Brave)

Full work available at URL: http://press1.swu.bg/media/19290/134pdf.pdf

Mathematics Subject Classification ID

Convex programming (90C25) Numerical optimization and variational techniques (65K10) Numerical methods based on nonlinear programming (49M37)

Related Items (4)

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 ⋮ Well-posedness and primal-dual analysis of some convex separable optimization problems ⋮ Estimation of optimum sample size allocation: An illustration with body mass index for evaluating the effect of a dietetic supplement

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