A deterministic method for solving the sum of linear ratios problem

DOI10.1155/2020/6174352zbMATH Open1459.90207OpenAlexW3088781802MaRDI QIDQ2004237FDOQ2004237

Authors: Zhenping Wang, Yonghong Zhang 

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

Recommendations

• A deterministic global optimization algorithm for sum of linear ratios problem
• A robust algorithm for a class of linear sum of ratios problem
• An effective algorithm for globally solving sum of linear ratios problems
• A new global algorithm for the sum of linear ratios problem
• A practicable branch and bound algorithm for sum of linear ratios problem
• A new linearizing method for sum of linear ratios problem with coefficients
• Effective algorithm and computational complexity for solving sum of linear ratios problem
• Reduction-branch-bound algorithm for solving sum of linear ratios problems
• A branch and bound algorithm to globally solve the sum of several linear ratios
• A revised algorithm for solving the sum of linear ratios problem with lower dimension using linear relaxation

Mathematics Subject Classification ID

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

Cites Work

• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• \(NP\)-hardness of linear multiplicative programming and related problems
• Cluster Analysis and Mathematical Programming
• BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
• On the global optimization of sums of linear fractional functions over a convex set
• 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
• A deterministic global optimization algorithm for generalized geometric programming
• A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
• A deterministic global optimization algorithm
• A new accelerating method for globally solving a class of nonconvex programming problems
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2004237)