A deterministic method for solving the sum of linear ratios problem

DOI10.1155/2020/6174352zbMath1459.90207OpenAlexW3088781802MaRDI QIDQ2004237

Yonghong Zhang, Zhenping Wang

Publication date: 14 October 2020

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/6174352

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• On the global optimization of sums of linear fractional functions over a convex set
• A deterministic global optimization algorithm
• A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
• A new accelerating method for globally solving a class of nonconvex programming problems
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• Image space analysis of generalized fractional programs
• Minimization of the sum of three linear fractional functions
• 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 deterministic global optimization algorithm for generalized geometric programming
• BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
• Cluster Analysis and Mathematical Programming

This page was built for publication: A deterministic method for solving the sum of linear ratios problem