A practicable branch and bound algorithm for sum of linear ratios problem
From MaRDI portal
Publication:319186
DOI10.1016/j.ejor.2015.01.039zbMath1346.90773OpenAlexW2061039541MaRDI QIDQ319186
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.01.039
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Fractional programming (90C32)
Related Items (33)
Regional division and reduction algorithm for minimizing the sum of linear fractional functions ⋮ A new branch and bound algorithm for minimax ratios problems ⋮ Solving generalized polynomial problem by using new affine relaxed technique ⋮ A reduced space branch and bound algorithm for a class of sum of ratios problems ⋮ Outcome space range reduction method for global optimization of sum of affine ratios problem ⋮ An efficient algorithm for computing a class of multiplicative optimization problem ⋮ A geometric branch-and-bound algorithm for the service bundle design problem ⋮ A solution approach for cardinality minimization problem based on fractional programming ⋮ Two-level linear relaxation method for generalized linear fractional programming ⋮ An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem ⋮ An efficient algorithm and complexity result for solving the sum of general affine ratios problem ⋮ 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 ⋮ A practicable contraction approach for the sum of the generalized polynomial ratios problem ⋮ An efficient algorithm for globally solving generalized linear multiplicative programming ⋮ 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 ⋮ An effective computational algorithm for the global solution of a class of linear fractional programming ⋮ An outcome space algorithm for minimizing a class of linear ratio optimization problems ⋮ An efficient global optimization algorithm for maximizing the sum of two generalized Rayleigh quotients ⋮ Range division and compression algorithm for quadratically constrained sum of quadratic ratios ⋮ Optimal spares allocation to an exchangeable-item repair system with tolerable wait ⋮ Integrated data envelopment analysis: linear vs. nonlinear model ⋮ Linear decomposition approach for a class of nonconvex programming problems ⋮ Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem ⋮ A conic relaxation model for searching for the global optimum of network data envelopment analysis ⋮ Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints ⋮ An effective algorithm for globally solving sum of linear ratios problems ⋮ Inner approximation algorithm for generalized linear multiplicative programming problems ⋮ An effective global optimization algorithm for quadratic programs with quadratic constraints ⋮ Solution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone Approximations ⋮ An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Network data envelopment analysis: a review
- An equilibrium efficiency frontier data envelopment analysis approach for evaluating decision-making units with fixed-sum outputs
- Global optimization algorithm for sum of generalized polynomial ratios problem
- 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
- An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem
- Global optimization of nonlinear sum of ratios problem
- On the global optimization of sums of linear fractional functions over a convex set
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs
- Computing non-dominated solutions in MOLFP
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
- A note on a deterministic global optimization algorithm
- A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem
- Solving the sum-of-ratios problems by a harmony search algorithm
- Global optimization for a class of fractional programming problems
- Fractional programming: Applications and algorithms
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Image space analysis of generalized fractional programs
- Linear-fractional programming. Theory, methods, applications and software.
- A unified monotonic approach to generalized linear fractional programming
- On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals
- Minimization of the sum of three linear fractional functions
- Conical partition algorithm for maximizing the sum of dc ratios
- An interior-point method for generalized linear-fractional programming
- Using conical partition to globally maximizing the nonlinear sum of ratios
- Fixed cost and resource allocation based on DEA cross-efficiency
- Strong duality for robust minimax fractional programming problems
- Integrated data envelopment analysis: global vs. local optimum
- Mathematical optimization ideas for biodiversity conservation
- A global optimization algorithm for linear fractional programming
- Global optimization for sum of generalized fractional functions
- Global optimization for sum of linear ratios problem with coefficients
- Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- A branch and bound algorithm to globally solve the sum of several linear ratios
- A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems
- Fractional programming: The sum-of-ratios case
- Queueing-location problems on the plane
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
- Nonlinear Programming
- Cluster Analysis and Mathematical Programming
- Convex analysis and global optimization
- A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
- Global optimization algorithm for the nonlinear sum of ratios problem
This page was built for publication: A practicable branch and bound algorithm for sum of linear ratios problem
