An effective computational algorithm for the global solution of a class of linear fractional programming
Summary: For the minimization of the sum of linear fractions on polyhedra, it is likewise a class of linear fractional programming (LFP). In this paper, we mainly propose a new linear relaxation technique and combine the branch-and-bound algorithm framework to solve the LFP globally. It is worthwhile to mention that the branching operation of the algorithm occurs in the relatively small output space of the dimension rather than the space where the decision variable is located. When the number of linear fractions in the objective function is much lower than the dimension of the decision variable, the performance of the algorithm is better. After that, we also explain the effectiveness, feasibility, and other performances of the algorithm through numerical experiments.
- A new deterministic global computing algorithm for solving a kind of linear fractional programming
- A global optimization algorithm for linear fractional programming
- Global optimization of a class of linear fractional programming problems
- A deterministic global optimization method for solving linear fractional programming
- Efficient algorithm for globally computing the min–max linear fractional programming problem
- \(NP\)-hardness of linear multiplicative programming and related problems
- A branch-and-cut algorithm for a class of sum-of-ratios problems
- A new approach for solving fully fuzzy linear fractional programming problems using the multi-objective linear programming
- A practicable branch and bound algorithm for sum of linear ratios problem
- A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems
- A unified monotonic approach to generalized linear fractional programming
- An interior-point method for generalized linear-fractional programming
- Approximation of linear fractional-multiplicative problems
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs
- Branch-reduction-bound algorithm for linear sum-of-ratios fractional programs
- Global algorithm for solving linear multiplicative programming problems
- Global optimization algorithm for sum of generalized polynomial ratios problem
- Global optimization for sum of linear ratios problem using new pruning technique
- scientific article; zbMATH DE number 757682 (Why is no real title available?)
- Image space analysis of generalized fractional programs
- Interval linear fractional programming: optimal value range of the objective function
- Linear Programming with a Fractional Objective Function
- Minimization of the sum of three linear fractional functions
- Minimizing support structures and trapped area in two-dimensional layered manufacturing
- Minimizing the sum of linear fractional functions over the cone of positive semidefinite matrices: approximation and applications
- On minimum-area hulls
- On Nonlinear Fractional Programming
- On some geometric optimization problems in layered manufacturing
- On the global optimization of sums of linear fractional functions over a convex set
- Outcome space range reduction method for global optimization of sum of affine ratios problem
- Programming with linear fractional functionals
- Range division and linearization algorithm for a class of linear ratios optimization problems
- Regional division and reduction algorithm for minimizing the sum of linear fractional functions
- Solving a class of generalized fractional programming problems using the feasibility of linear programs
- A denominators outcome-space branch and bound algorithm for solving linear fractional sum programming problems
- Efficient algorithms for solving nonlinear fractional programming problems
- Global optimization of a class of linear fractional programming problems
- A new deterministic global computing algorithm for solving a kind of linear fractional programming
- An efficient global optimization algorithm for the sum of linear ratios problems based on a novel adjustable branching rule
- Regional division and reduction algorithm for minimizing the sum of linear fractional functions
This page was built for publication: An effective computational algorithm for the global solution of a class of linear fractional programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2214840)
