An outcome space algorithm for minimizing a class of linear ratio optimization problems
From MaRDI portal
Publication:2245774
DOI10.1007/S40314-021-01614-3zbMATH Open1476.90321OpenAlexW3194434306MaRDI QIDQ2245774FDOQ2245774
Authors: Li Ge, Sanyang Liu 
Publication date: 15 November 2021
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-021-01614-3
Recommendations
- Reduction-branch-bound algorithm for solving sum of linear ratios problems
- scientific article; zbMATH DE number 7267293
- Range division and linearization algorithm for a class of linear ratios optimization problems
- An output-space branch-and-bound algorithm for finding the global solution of the sum-of-linear-ratios problem
- scientific article; zbMATH DE number 7109241
global optimizationbranch-and-boundaffine relaxation programming problemlinear ratio optimization problem
Cites Work
- An interior-point method for generalized linear-fractional programming
- Solving the sum-of-ratios problem by an interior-point method
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- A global optimization algorithm for linear fractional programming
- \(NP\)-hardness of linear multiplicative programming and related problems
- Image space analysis of generalized fractional programs
- Linear-fractional programming. Theory, methods, applications and software.
- On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals
- Global optimization for sum of generalized fractional functions
- Global optimization for sum of linear ratios problem with coefficients
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- A practicable branch and bound algorithm for sum of linear ratios problem
- Global optimization algorithm for sum of generalized polynomial ratios problem
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- Outcome space range reduction method for global optimization of sum of affine ratios problem
- Range division and compression algorithm for quadratically constrained sum of quadratic ratios
- Approximation of linear fractional-multiplicative problems
- Title not available (Why is that?)
- An Efficient algorithm for quadratic sum-of-ratios fractional programs problem
- Range division and linearization algorithm for a class of linear ratios optimization problems
Cited In (7)
- A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming
- A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem
- A new global optimization algorithm for mixed-integer quadratically constrained quadratic fractional programming problem
- Ratio-conjugation tool and its application in linear optimization models†
- An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem
- A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation
- Title not available (Why is that?)
Uses Software
This page was built for publication: An outcome space algorithm for minimizing a class of linear ratio optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2245774)
