A new approach for solving generalized linear fractional programming

zbMATH Open1289.90220MaRDI QIDQ2860426FDOQ2860426

Authors: Yonghong Zhang, Chunfeng Wang 

Publication date: 19 November 2013

Published in: Mathematica Applicata (Search for Journal in Brave)

Recommendations

• A new procedure for solving linear fractional programming problems
• Solving a class of generalized fractional programming problems using the feasibility of linear programs
• A new algorithm for generalized fractional programs
• scientific article; zbMATH DE number 3932814
• Generalized linear multiplicative and fractional programming
• Partial linearization for generalized fractional programming
• scientific article; zbMATH DE number 3989122
• A new method for solving the sum of linear and linear fractional programming problems

zbMATH Keywords

global optimizationbranch and boundlinear relaxationgeneralized linear fractional programming

Mathematics Subject Classification ID

Fractional programming (90C32) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Cited In (7)

• A branch and bound algorithm for solving the sum of generalized polynomial fractional programming problem
• Title not available (Why is that?)
• A denominators outcome-space branch and bound algorithm for solving linear fractional sum programming problems
• Title not available (Why is that?)
• Two-level linear relaxation method for generalized linear fractional programming
• Global optimization of generalized linear fractional programming with nonlinear constraints
• Global optimization of a class of linear fractional programming problems

This page was built for publication: A new approach for solving generalized linear fractional programming

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