An effective computational algorithm for the global solution of a class of linear fractional programming

DOI10.1155/2020/3580419zbMath1459.90206OpenAlexW3098914648MaRDI QIDQ2214840

Xia Liu, Bo Zhang, Xiao Li Huang, Yuelin Gao

Publication date: 10 December 2020

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/3580419

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Fractional programming (90C32)

Cites Work

• Unnamed Item
• Unnamed Item
• A practicable branch and bound algorithm for sum of linear ratios problem
• Outcome space range reduction method for global optimization of sum of affine ratios problem
• Global optimization algorithm for sum of generalized polynomial ratios problem
• Approximation of linear fractional-multiplicative problems
• A branch-and-cut algorithm for a class of sum-of-ratios problems
• On the global optimization of sums of linear fractional functions over a convex set
• Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs
• Regional division and reduction algorithm for minimizing the sum of linear fractional functions
• Interval linear fractional programming: optimal value range of the objective function
• Global optimization for sum of linear ratios problem using new pruning technique
• On some geometric optimization problems in layered manufacturing
• Minimizing support structures and trapped area in two-dimensional layered manufacturing
• Image space analysis of generalized fractional programs
• On minimum-area hulls
• A unified monotonic approach to generalized linear fractional programming
• Minimization of the sum of three linear fractional functions
• Range division and linearization algorithm for a class of linear ratios optimization problems
• An interior-point method for generalized linear-fractional programming
• Global algorithm for solving linear multiplicative programming problems
• Solving a class of generalized fractional programming problems using the feasibility of linear programs
• Minimizing the sum of linear fractional functions over the cone of positive semidefinite matrices: approximation and applications
• \(NP\)-hardness of linear multiplicative programming and related problems
• A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems
• A new approach for solving fully fuzzy linear fractional programming problems using the multi-objective linear programming
• Programming with linear fractional functionals
• On Nonlinear Fractional Programming
• Linear Programming with a Fractional Objective Function

This page was built for publication: An effective computational algorithm for the global solution of a class of linear fractional programming