Global optimization of nonlinear sum of ratios problem
From MaRDI portal
Publication:702537
DOI10.1016/j.amc.2003.08.113zbMath1065.65081OpenAlexW2061454251MaRDI QIDQ702537
Publication date: 17 January 2005
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2003.08.113
global optimizationsimplex algorithmfractional programmingbranch and bound algorithmnonlinear sum of ratios
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30)
Related Items
A note on the paper ``Global optimization of nonlinear sum of ratios, A practicable branch and bound algorithm for sum of linear ratios problem, An efficient algorithm for computing a class of multiplicative optimization problem, Global optimization algorithm for sum of generalized polynomial ratios problem, Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm, A new deterministic global computing algorithm for solving a kind of linear fractional programming, Global minimization for generalized polynomial fractional program, Global optimization for the sum of certain nonlinear functions, A branch-and-cut algorithm for a class of sum-of-ratios problems, Efficient local search procedures for quadratic fractional programming problems, Range division and compression algorithm for quadratically constrained sum of quadratic ratios, Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem, Global optimization for the generalized polynomial sum of ratios problem, Global optimization for sum of geometric fractional functions, Solving sum of quadratic ratios fractional programs via monotonic function, Global optimization for the sum of concave-convex ratios problem, An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
Cites Work
- Unnamed Item
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- Using concave envelopes to globally solve the nonlinear sum of ratios problem
- Global optimization of nonconvex polynomial programming problems having rational exponents
- Minimization of the sum of three linear fractional functions
- Solving the sum-of-ratios problem by an interior-point method
- An algorithm for global optimization using the Taylor-Bernstein form as inclusion function
- On the posynomial fractional programming problems
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
- Global optimization algorithm for the nonlinear sum of ratios problem
