scientific article; zbMATH DE number 6907481

DOI10.13548/J.SXZZ.20161201.003MaRDI QIDQ3175206zbMATH OpenFDO

Authors Chunfeng Wang, Yan Jiang, Peiping Shen

Publication date 18 July 2018

Full work available at URL https://doi.org/10.13548/J.SXZZ.20161201.003

zbMATH Keywords

branch-and-boundglobal optimizationlinear relaxationminimax linear fractional programming

Mathematics Subject Classification ID

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

Recommendations

• An effective branch and bound algorithm for minimax linear fractional programming
• A new linearization technique for minimax linear fractional programming
• A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
• A new procedure for solving linear fractional programming problems
• A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem
• Branch-reduction-bound algorithm for linear sum-of-ratios fractional programs
• scientific article; zbMATH DE number 66872
• scientific article; zbMATH DE number 4080779

Cited in

(19)

• Solving the conditional optimization problem for a fractional linear objective function on a set of arrangements by the branch and bound method
• An effective branch and bound algorithm for minimax linear fractional programming
• A new branch and bound algorithm for minimax ratios problems
• A branch-bound cut technique for non-linear fractional multi-objective optimization problems
• A denominators outcome-space branch and bound algorithm for solving linear fractional sum programming problems
• A new linearization technique for minimax linear fractional programming
• A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem
• A note on integer solutions to linear fractional interval programming problems by a branch & bound technique
• scientific article; zbMATH DE number 4080779 (Why is no real title available?)
• scientific article; zbMATH DE number 66872 (Why is no real title available?)
• Branch and bound computation of the minimum norm of a linear fractional transformation over a structured set
• Image space branch-and-bound algorithm for globally solving minimax linear fractional programming problem
• Efficient algorithm for globally computing the min–max linear fractional programming problem
• Interval division and linearization algorithm for minimax linear fractional program
• A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming
• Global algorithm for effectively solving min-max affine fractional programs
• Outcome-space based B{\&}B algorithm for min-max affine fractional programs through a series of linear relaxation techniques to solve large-size problems
• Optimizing the minimax affine fractional problem in reduced space
• A novel affine relaxation-based algorithm for minimax affine fractional program

This page was built for publication:

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