A deterministic global optimization algorithm
From MaRDI portal
Publication:870181
DOI10.1016/j.amc.2006.06.101zbMath1114.65062OpenAlexW2055002919MaRDI QIDQ870181
Ying Ji, Shao-Jian Qu, Ke-Cun Zhang
Publication date: 12 March 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.06.101
convergencenumerical examplesbranch and bound algorithmlinearization relaxationgeneral linear sum of ratios
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Fractional programming (90C32)
Related Items
Regional division and reduction algorithm for minimizing the sum of linear fractional functions, A global optimization algorithm for linear fractional programming, Outcome space range reduction method for global optimization of sum of affine ratios problem, Global optimization algorithm for sum of generalized polynomial ratios problem, A linearized relaxing algorithm for the specific nonlinear optimization problem, Study of multiscale global optimization based on parameter space partition, Optimizing radial basis functions by d.c. programming and its use in direct search for global derivative-free optimization, An efficient algorithm and complexity result for solving the sum of general affine ratios problem, A new deterministic global computing algorithm for solving a kind of linear fractional programming, A potential practical algorithm for minimizing the sum of affine fractional functions, A note on a deterministic global optimization algorithm, A note on ``Taylor series approach to fuzzy multiple objective linear fractional programming, A deterministic method for solving the sum of linear ratios problem, Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints, An effective algorithm for globally solving sum of linear ratios problems, Global optimization for sum of linear ratios problem using new pruning technique
Cites Work
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Minimization of the sum of three linear fractional functions
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
- Programming with linear fractional functionals