An effective computational algorithm for the global solution of a class of linear fractional programming
From MaRDI portal
Publication:2214840
DOI10.1155/2020/3580419zbMATH Open1459.90206OpenAlexW3098914648MaRDI QIDQ2214840FDOQ2214840
Authors: Xiaoli Huang, Bo Zhang, Xia Liu, 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
Recommendations
- 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
Fractional programming (90C32) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Cites Work
- Programming with linear fractional functionals
- On Nonlinear Fractional Programming
- An interior-point method for generalized linear-fractional programming
- Title not available (Why is that?)
- \(NP\)-hardness of linear multiplicative programming and related problems
- A unified monotonic approach to generalized linear fractional programming
- On the global optimization of sums of linear fractional functions over a convex set
- Image space analysis of generalized fractional programs
- Minimization of the sum of three linear fractional functions
- A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems
- A practicable branch and bound algorithm for sum of linear ratios problem
- Global optimization algorithm for sum of generalized polynomial ratios problem
- A branch-and-cut algorithm for a class of sum-of-ratios problems
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs
- Outcome space range reduction method for global optimization of sum of affine ratios problem
- Global optimization for sum of linear ratios problem using new pruning technique
- Minimizing the sum of linear fractional functions over the cone of positive semidefinite matrices: approximation and applications
- Approximation of linear fractional-multiplicative problems
- On minimum-area hulls
- On some geometric optimization problems in layered manufacturing
- Minimizing support structures and trapped area in two-dimensional layered manufacturing
- Linear Programming with a Fractional Objective Function
- Global algorithm for solving linear multiplicative programming problems
- Branch-reduction-bound algorithm for linear 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
- A new approach for solving fully fuzzy linear fractional programming problems using the multi-objective linear programming
- Solving a class of generalized fractional programming problems using the feasibility of linear programs
- Range division and linearization algorithm for a class of linear ratios optimization problems
Cited In (5)
- Regional division and reduction algorithm for minimizing the sum of linear fractional functions
- A denominators outcome-space branch and bound algorithm for solving linear fractional sum 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
- Efficient algorithms for solving nonlinear fractional programming problems
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)
