Regional division and reduction algorithm for minimizing the sum of linear fractional functions

DOI10.1186/s13660-018-1651-9zbMath1497.90201OpenAlexW2803653213WikidataQ51731276 ScholiaQ51731276MaRDI QIDQ824489

Pei-Ping Shen, Ting Lu

Publication date: 15 December 2021

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s13660-018-1651-9

zbMATH Keywords

global optimizationfractional programmingsum of linear ratiosregional division and reduction

Mathematics Subject Classification ID

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

Related Items (12)

A solution approach for cardinality minimization problem based on fractional programming ⋮ A linearization to the multi-objective linear plus linear fractional program ⋮ 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 ⋮ 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 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
• A practicable branch and bound algorithm for sum of linear ratios problem
• Global optimization algorithm for sum of generalized polynomial ratios problem
• Approximation of linear fractional-multiplicative problems
• A deterministic global optimization algorithm
• A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• Minimizing support structures and trapped area in two-dimensional layered manufacturing
• Solving the sum-of-ratios problem by an interior-point method
• Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications
• Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions
• Integrated data envelopment analysis: global vs. local optimum
• A global optimization algorithm for linear fractional programming
• A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension
• 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
• \(NP\)-hardness of linear multiplicative programming and related problems
• Queueing-location problems on the plane
• Cluster Analysis and Mathematical Programming
• Convex analysis and global optimization
• Determining an optimal penetration among weighted regions in two and three dimensions

This page was built for publication: Regional division and reduction algorithm for minimizing the sum of linear fractional functions