A deterministic algorithm for solving a series of fractional programming problems

MaRDI QIDQ3403517zbMATH OpenFDO

Authors Hong-Wei Jiao, Yunrui Go, Yongqiang Chen

Publication date 12 February 2010

zbMATH Keywords

branch-and-boundfractional programmingglobal optimizationlinearization technique

Mathematics Subject Classification ID

Fractional programming (90C32) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A deterministic global optimization algorithm
• A deterministic global optimization method for solving linear fractional programming
• A new deterministic global computing algorithm for solving a kind of linear fractional programming
• A new linearization technique for minimax linear fractional programming
• A deterministic global optimization algorithm

Cited in

(4)

• A new linearization technique for minimax linear fractional programming
• A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem
• A deterministic global optimization method for solving linear fractional programming
• A deterministic global optimization algorithm

This page was built for publication: A deterministic algorithm for solving a series of fractional programming problems

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