Regional division and reduction algorithm for minimizing the sum of linear fractional functions
From MaRDI portal
(Redirected from Publication:824489)
Recommendations
- Minimization of the sum of three linear fractional functions
- scientific article; zbMATH DE number 1342815
- scientific article; zbMATH DE number 1664572
- An effective computational algorithm for the global solution of a class of linear fractional programming
- Global minimization for generalized polynomial fractional program
Cites work
- scientific article; zbMATH DE number 1342815 (Why is no real title available?)
- A deterministic global optimization algorithm
- A global optimization algorithm for linear fractional programming
- A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension
- A practicable branch and bound algorithm for sum of linear ratios problem
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
- Approximation of linear fractional-multiplicative problems
- Branch-reduction-bound algorithm for linear sum-of-ratios fractional programs
- Cluster Analysis and Mathematical Programming
- Convex analysis and global optimization
- Determining an optimal penetration among weighted regions in two and three dimensions
- Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications
- Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions
- Global optimization algorithm for sum of generalized polynomial ratios problem
- Global optimization for sum of linear ratios problem with coefficients
- Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region
- Integrated data envelopment analysis: global vs. local optimum
- Minimizing support structures and trapped area in two-dimensional layered manufacturing
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Queueing-location problems on the plane
- Solving the sum-of-ratios problem by an interior-point method
- \(NP\)-hardness of linear multiplicative programming and related problems
Cited in
(14)- An effective computational algorithm for the global solution of a class of linear fractional programming
- An effective global optimization algorithm for quadratic programs with quadratic constraints
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
- A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem
- An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications
- Rank-two programs involving linear fractional functions
- Effective algorithm and computational complexity for solving sum of linear ratios problem
- A potential practical algorithm for minimizing the sum of affine fractional functions
- An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem
- A solution approach for cardinality minimization problem based on fractional programming
- A practicable contraction approach for the sum of the generalized polynomial ratios problem
- An efficient algorithm and complexity result for solving the sum of general affine ratios problem
- A new deterministic global computing algorithm for solving a kind of linear fractional programming
- A linearization to the multi-objective linear plus linear fractional program
This page was built for publication: Regional division and reduction algorithm for minimizing the sum of linear fractional functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q824489)
