An efficient algorithm for solving a class of fractional programming problems

DOI10.1155/2021/5556130zbMATH Open1512.90226MaRDI QIDQ6484437FDOQ6484437

Authors: Yongjian Qiu, Yuming Zhu, Jing-Ben Yin 

Publication date: 25 January 2022

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

Recommendations

• Global optimization of a class of linear fractional programming problems
• scientific article; zbMATH DE number 6179040
• A deterministic global optimization algorithm
• An \(\varepsilon\)-approximation algorithm for a class of fractional programs
• A global optimization algorithm for linear fractional programming

Mathematics Subject Classification ID

Fractional programming (90C32)

Cited In (12)

• Efficient local search procedures for quadratic fractional programming problems
• An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications
• Two-level linear relaxation method for generalized linear fractional programming
• A deterministic global optimization algorithm
• Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games
• A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem
• Approximation algorithms for combinatorial fractional programming problems
• A new global optimization algorithm for mixed-integer quadratically constrained quadratic fractional programming problem
• An \(\varepsilon\)-approximation algorithm for a class of fractional programs
• A practical nonlinear dynamic framework for solving a class of fractional programming problems
• Global optimization of a class of linear fractional programming problems
• Efficient algorithms for solving nonlinear fractional programming problems

This page was built for publication: An efficient algorithm for solving a class of fractional programming problems

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