A deterministic global optimization method for solving linear fractional programming

MaRDI QIDQ3572863zbMATH OpenFDO

Authors Chunfeng Wang, Ming-Pu Guo, Peiping Shen

Publication date 8 July 2010

zbMATH Keywords

branch and boundglobal optimizationlinear fractional programminglinear relaxed method

Mathematics Subject Classification ID

Linear programming (90C05) Fractional programming (90C32)

Recommendations

• A deterministic algorithm for solving a series of fractional programming problems
• 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
• scientific article; zbMATH DE number 6179040

Cited in

(10)

• An effective computational algorithm for the global solution of a class of linear fractional programming
• A new linearization technique for minimax linear fractional programming
• A deterministic algorithm for solving a series of fractional programming problems
• A deterministic global optimization algorithm
• scientific article; zbMATH DE number 6179040 (Why is no real title available?)
• scientific article; zbMATH DE number 5221414 (Why is no real title available?)
• An algorithm for solving linear fractional programming problems
• A new deterministic global computing algorithm for solving a kind of linear fractional programming
• On the global optimization of sums of linear fractional functions over a convex set
• An algorithm for solving quadratic fractional program with linear homogeneous constraints

This page was built for publication: A deterministic global optimization method for solving linear fractional programming

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