scientific article; zbMATH DE number 6472514

zbMath1352.90077MaRDI QIDQ5501734

Weimin Li, Yan-Chao Liang, Pei-Ping Shen

Publication date: 14 August 2015

Full work available at URL: http://www.yokohamapublishers.jp/online2/oppjo/vol11/p79.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

global optimizationbranch-and-boundbound tighteningcone reductionlinear sum-of-ratios

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Fractional programming (90C32)

Related Items (9)

Solving a class of generalized fractional programming problems using the feasibility of linear programs ⋮ Regional division and reduction algorithm for minimizing the sum of linear fractional functions ⋮ Globally minimizing the sum of a convex-concave fraction and a convex function based on wave-curve bounds ⋮ 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 ⋮ An effective computational algorithm for the global solution of a class of linear fractional programming ⋮ A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation

This page was built for publication: