An effective branch and bound algorithm for minimax linear fractional programming

DOI10.1155/2014/160262zbMath1437.90153OpenAlexW2005377524WikidataQ59050019 ScholiaQ59050019MaRDI QIDQ2336179

Feng Hui Wang, Yong-Qiang Chen, Hong-Wei Jiao

Publication date: 19 November 2019

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

Full work available at URL: https://doi.org/10.1155/2014/160262

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Fractional programming (90C32)

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm for generalized fractional programs
• An inexact proximal point method for solving generalized fractional programs
• Convergence of interval-type algorithms for generalized fractional programming
• Duality in generalized fractional programming via Farkas' lemma
• Financial planning with fractional goals
• A unified monotonic approach to generalized linear fractional programming
• An interior-point method for fractional programs with convex constraints
• An exact method for fractional goal programming
• Generalized fractional programming and cutting plane algorithms
• An interior-point method for generalized linear-fractional programming
• Using duality to solve generalized fractional programming problems
• Approximation algorithm for a class of global optimization problems
• A Fast Algorithm for a Class of Generalized Fractional Programs
• Best Rational Approximation and Strict Quasi-Convexity
• Method of centers for generalized fractional programming