A deterministic global optimization method for solving linear fractional programming

zbMATH Open1212.90380MaRDI QIDQ3572863FDOQ3572863

Authors: Chunfeng Wang, Ming-Pu Guo, Peiping Shen 

Publication date: 8 July 2010

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

zbMATH Keywords

global optimizationbranch and boundlinear fractional programminglinear relaxed method

Mathematics Subject Classification ID

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

Cited In (9)

• An effective computational algorithm for the global solution of a class of linear fractional programming
• Title not available (Why is that?)
• A deterministic algorithm for solving a series of fractional programming problems
• Title not available (Why is that?)
• A deterministic global optimization algorithm
• 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
• A new deterministic global computing algorithm for solving a kind of linear fractional programming
• A new linearization technique for minimax linear fractional programming

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)