Range division and linearization algorithm for a class of linear ratios optimization problems

DOI10.1016/j.cam.2018.10.038zbMath1405.90109OpenAlexW2898670674MaRDI QIDQ1713180

Lufan Wang, Bingdi Huang, Pei-Ping Shen

Publication date: 24 January 2019

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2018.10.038

zbMATH Keywords

computational complexityglobal optimizationapproximation algorithmfractional programmingrange division and linearization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Fractional programming (90C32)

Related Items (17)

Solving generalized polynomial problem by using new affine relaxed technique ⋮ 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 ⋮ 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 ⋮ A practicable contraction approach for the sum of the generalized polynomial ratios problem ⋮ Effective algorithm and computational complexity for solving sum of linear ratios problem ⋮ 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 ⋮ Outer space branch and bound algorithm for solving linear multiplicative programming problems ⋮ Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems ⋮ An effective global optimization algorithm for quadratic programs with quadratic constraints ⋮ An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A practicable branch and bound algorithm for sum of linear ratios problem
• Outcome space range reduction method for global optimization of sum of affine ratios problem
• An FPTAS for optimizing a class of low-rank functions over a polytope
• Global minimization of a generalized linear multiplicative programming
• Linear decomposition approach for a class of nonconvex programming problems
• Approximation of linear fractional-multiplicative problems
• A new linearization method for generalized linear multiplicative programming
• Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs
• A FPTAS for a class of linear multiplicative problems
• An outcome-space finite algorithm for solving linear multiplicative programming
• A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
• An efficient algorithm for globally solving generalized linear multiplicative programming
• A new accelerating method for globally solving a class of nonconvex programming problems
• A nonisolated optimal solution of general linear multiplicative programming problems
• Global optimization for sum of linear ratios problem using new pruning technique
• Image space analysis of generalized fractional programs
• A unified monotonic approach to generalized linear fractional programming
• Heuristic methods for linear multiplicative programming
• An interior-point method for generalized linear-fractional programming
• Approximation algorithm for a class of global optimization problems
• Generalized linear multiplicative and fractional programming
• Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
• Solving a class of generalized fractional programming problems using the feasibility of linear programs
• A global optimization algorithm for linear fractional programming
• On solving the sum-of-ratios problem
• 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
• \(NP\)-hardness of linear multiplicative programming and related problems
• A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
• Fractional programming

This page was built for publication: Range division and linearization algorithm for a class of linear ratios optimization problems