A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
From MaRDI portal
Publication:881518
DOI10.1016/j.ejor.2006.08.036zbMath1121.90102OpenAlexW2026971626MaRDI QIDQ881518
Publication date: 30 May 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.08.036
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32)
Related Items
Regional division and reduction algorithm for minimizing the sum of linear fractional functions, A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming, A review of recent advances in global optimization, A practicable branch and bound algorithm for sum of linear ratios problem, Parameterized approximations for the two-sided assortment optimization, Global optimization algorithm for sum of generalized polynomial ratios problem, On the quadratic fractional optimization with a strictly convex quadratic constraint, Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm, An efficient algorithm and complexity result for solving the sum of general affine ratios problem, An accelerating outer space algorithm for globally solving generalized linear multiplicative problems, A spatial branch and bound algorithm for solving the sum of linear ratios optimization 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, Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models, A practicable contraction approach for the sum of the generalized polynomial ratios problem, A new efficient approach to tackle multi objective linear fractional problem with flexible constraints, Effective algorithm and computational complexity for solving sum of linear ratios problem, Range division and linearization algorithm for a class of linear ratios optimization problems, Global optimization for a class of nonlinear sum of ratios problem, Global minimization for generalized polynomial fractional program, A new accelerating method for globally solving a class of nonconvex programming problems, A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension, A branch-and-cut algorithm for a class of sum-of-ratios problems, An outcome space algorithm for minimizing a class of linear ratio optimization 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, A deterministic method for solving the sum of linear ratios problem, An outcome space approach for generalized convex multiplicative programs, Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region, An effective algorithm for globally solving sum of linear ratios problems, A branch and bound algorithm for globally solving a class of nonconvex programming problems, A geometric branch and bound method for robust maximization of convex functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Global minimization of a generalized convex multiplicative function
- Image space analysis of generalized fractional programs
- Lagrange duality and partitioning techniques in nonconvex global optimization
- A unified monotonic approach to generalized linear fractional programming
- A global optimization algorithm for linear fractional and bilinear programs
- \(NP\)-hardness of linear multiplicative programming and related problems
- A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems
- Solving sum-of-ratios fractional programs using efficient points
- Fractional programming: The sum-of-ratios case
- Queueing-location problems on the plane
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- On Maximizing a Sum of Ratios
- A note on the sum of a linear and linear-fractional function
- Cluster Analysis and Mathematical Programming
- A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
