An effective algorithm for globally solving sum of linear ratios problems
Summary: In this study, we propose an effective algorithm for globally solving the sum of linear ratios problems. Firstly, by introducing new variables, we transform the initial problem into an equivalent nonconvex programming problem. Secondly, by utilizing direct relaxation, the linear relaxation programming problem of the equivalent problem can be constructed. Thirdly, in order to improve the computational efficiency of the algorithm, an out space pruning technique is derived, which offers a possibility of pruning a large part of the out space region which does not contain the optimal solution of the equivalent problem. Fourthly, based on out space partition, by combining bounding technique and pruning technique, a new out space branch-and-bound algorithm for globally solving the sum of linear ratios problems (SLRP) is designed. Finally, numerical experimental results are presented to demonstrate both computational efficiency and solution quality of the proposed algorithm.
- A new global algorithm for the sum of linear ratios problem
- A practicable branch and bound algorithm for sum of linear ratios problem
- A global optimization algorithm for sum of linear ratios problem
- Global optimization algorithm for solving sum of linear ratios problems
- A global optimization algorithm for sum of linear ratios problem
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
- A branch and bound algorithm to globally solve the sum of several linear ratios
- A deterministic global optimization algorithm
- A genetic algorithm using a finite search space for solving nonlinear/linear fractional bilevel programming problems
- A global optimization algorithm for linear fractional programming
- A practicable branch and bound algorithm for sum of linear ratios problem
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
- A unified monotonic approach to generalized linear fractional programming
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
- Cluster Analysis and Mathematical Programming
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- Global optimization for sum of linear ratios problem with coefficients
- Global solutions to fractional programming problem with ratio of nonconvex functions
- Image space analysis of generalized fractional programs
- On the global optimization of sums of linear fractional functions over a convex set
- Outcome space range reduction method for global optimization of sum of affine ratios problem
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Programming with linear fractional functionals
- Reduction-branch-bound algorithm for solving sum of linear ratios problems
- Robust fractional programming
- A new linearizing method for sum of linear ratios problem with coefficients
- A deterministic method for solving the sum of linear ratios problem
- A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension
- A branch and bound algorithm to globally solve the sum of several linear ratios
- Effective algorithm and computational complexity for solving sum of linear ratios problem
- A revised algorithm for solving the sum of linear ratios problem with lower dimension using linear relaxation
This page was built for publication: An effective algorithm for globally solving sum of linear ratios problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1794234)
