A branch-and-bound algorithm to globally solve the sum of several linear ratios
暂无分享,去创建一个
[1] Takahito Kuno,et al. A branch-and-bound algorithm for maximizing the sum of several linear ratios , 2002, J. Glob. Optim..
[2] Hiroshi Konno,et al. Global minimization of a generalized convex multiplicative function , 1994, J. Glob. Optim..
[3] Tomomi Matsui,et al. Parametric simplex algorithms for solving a special class of nonconvex minimization problems , 1991, J. Glob. Optim..
[4] Abraham Charnes,et al. Programming with linear fractional functionals , 1962 .
[5] Hiroshi Konno,et al. Minimization of the sum of three linear fractional functions , 1999, J. Glob. Optim..
[6] HAROLD P. BENSON. Using concave envelopes to globally solve the nonlinear sum of ratios problem , 2002, J. Glob. Optim..
[7] Hanif D. Sherali,et al. Global Optimization of Nonconvex Polynomial Programming Problems Having Rational Exponents , 1998, J. Glob. Optim..
[8] R. Horst,et al. Global Optimization: Deterministic Approaches , 1992 .