A branch-and-bound algorithm for maximizing the sum of several linear ratios
From MaRDI portal
Publication:598594
DOI10.1023/A:1013807129844zbMath1045.90071OpenAlexW1556949287MaRDI QIDQ598594
Publication date: 12 August 2004
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1013807129844
Related Items (68)
Minimizing the sum of many rational functions ⋮ Generating the efficient set of multiobjective integer linear plus linear fractional programming problems ⋮ Global solutions to fractional programming problem with ratio of nonconvex functions ⋮ A reference point technique to compute nondominated solutions in MOLFP ⋮ Non polyhedral convex envelopes for 1-convex functions ⋮ A practicable branch and bound algorithm for sum of linear ratios problem ⋮ An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints ⋮ Maximizing for the sum of ratios of two convex functions over a convex set ⋮ Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique ⋮ Global optimization of generalized linear fractional programming with nonlinear constraints ⋮ A deterministic global optimization algorithm ⋮ Generating sum-of-ratios test problems in global optimization ⋮ Computing non-dominated solutions in MOLFP ⋮ A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem ⋮ Alternative branching rules for some nonconvex problems ⋮ Minimization of isotonic functions composed of Fractions ⋮ Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex ⋮ 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 practical but rigorous approach to sum-of-ratios optimization in geometric applications ⋮ An exact method for solving the integer sum of linear ratios problem ⋮ Effective algorithm and computational complexity for solving sum of linear ratios problem ⋮ A global optimization algorithm for sum of quadratic ratios problem with coefficients ⋮ Using conical partition to globally maximizing the nonlinear sum of ratios ⋮ Unnamed Item ⋮ Global optimization for a class of nonlinear sum of ratios problem ⋮ Global minimization for generalized polynomial fractional program ⋮ 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 ⋮ Solving sum of ratios fractional programs via concave minimization ⋮ Efficient local search procedures for quadratic fractional programming problems ⋮ Solving fractional problems with dynamic multistart improving hit-and-run ⋮ A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem ⋮ An iterative approach to solve multiobjective linear fractional programming problems ⋮ An outcome space algorithm for minimizing a class of linear ratio optimization problems ⋮ A technique to derive the analytical form of convex envelopes for some bivariate functions ⋮ Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes ⋮ Convex envelopes of bivariate functions through the solution of KKT systems ⋮ Global optimization for sum of generalized fractional functions ⋮ An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem ⋮ Solving the sum-of-ratios problems by a harmony search algorithm ⋮ Global optimization of nonlinear sum of ratios problem ⋮ Acceleration procedure for special classes of multi-extremal problems ⋮ On the global optimization of sums of linear fractional functions over a convex set ⋮ An approach for minimizing a quadratically constrained fractional quadratic problem with application to the communications over wireless channels ⋮ Global optimization for sum of linear ratios problem with coefficients ⋮ Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs ⋮ Global optimization for sum of geometric fractional functions ⋮ Conical partition algorithm for maximizing the sum of dc ratios ⋮ Global optimization of nonlinear sums of ratios ⋮ Optimization of chance constraint programming with sum-of-fractional objectives â an application to assembled printed circuit board problem ⋮ Global optimization algorithm for the nonlinear sum of ratios problem ⋮ Maximizing the sum of a generalized Rayleigh quotient and another Rayleigh quotient on the unit sphere via semidefinite programming ⋮ Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problems ⋮ A doubly nonnegative relaxation for modularity density maximization ⋮ Global optimization for sum of linear ratios problem using new pruning technique ⋮ Resource allocation: a common set of weights model ⋮ Solving the sum-of-ratios problem by a stochastic search algorithm ⋮ Solving sum of quadratic ratios fractional programs via monotonic function ⋮ A parametric solution method for a generalized fractional programming problem ⋮ A Branch & Cut Algorithm to Compute Nondominated Solutions in MOLFP via Reference Points ⋮ Global optimization for a class of fractional programming problems ⋮ Convex envelopes for ray-concave functions ⋮ A branch and bound algorithm to globally solve the sum of several linear ratios ⋮ A sixth bibliography of fractional programming ⋮ Global optimization for the sum of concave-convex ratios problem ⋮ Solution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone Approximations ⋮ A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems
This page was built for publication: A branch-and-bound algorithm for maximizing the sum of several linear ratios