A potential practical algorithm for minimizing the sum of affine fractional functions
From MaRDI portal
(Redirected from Publication:6106325)
Recommendations
- Regional division and reduction algorithm for minimizing the sum of linear fractional functions
- Minimizing the sum of a convex function and the product of two affine functions over a convex set
- Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions
- Minimization of the sum of three linear fractional functions
- Global optimization for sum of geometric fractional functions
Cites work
- scientific article; zbMATH DE number 1342815 (Why is no real title available?)
- scientific article; zbMATH DE number 1095224 (Why is no real title available?)
- A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
- A branch and bound algorithm to globally solve the sum of several linear ratios
- A deterministic global optimization algorithm
- A eighth bibliography of fractional programming
- A global optimization algorithm for linear fractional and bilinear programs
- A global optimization algorithm for linear fractional programming
- A global optimization algorithm for sum of linear ratios problem
- A hybrid LP/NLP paradigm for global optimization relaxations
- A new reformulation-linearization technique for bilinear programming problems
- A practicable branch and bound algorithm for sum of linear ratios problem
- A practicable contraction approach for the sum of the generalized polynomial ratios problem
- A practical but rigorous approach to sum-of-ratios optimization in geometric applications
- A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
- A sixth bibliography of fractional programming
- A unified monotonic approach to generalized linear fractional programming
- Approximation of linear fractional-multiplicative problems
- Bibliography: Ninth bibliography of fractional programming
- Branch-reduction-bound algorithm for linear sum-of-ratios fractional programs
- Fractional programming: The sum-of-ratios case
- Global optimization algorithm for sum of generalized polynomial ratios problem
- Image space analysis of generalized fractional programs
- Linear decomposition approach for a class of nonconvex programming problems
- Linear-fractional programming. Theory, methods, applications and software.
- Maximizing for the sum of ratios of two convex functions over a convex set
- On Maximizing a Sum of Ratios
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- 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
Cited in
(14)- A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems
- An efficient global optimization algorithm for the sum of linear ratios problems based on a novel adjustable branching rule
- A novel affine relaxation-based algorithm for minimax affine fractional program
- An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications
- Global algorithm for effectively solving min-max affine fractional programs
- scientific article; zbMATH DE number 1342815 (Why is no real title available?)
- Image space branch-reduction-bound algorithm for globally solving the sum of affine ratios problem
- An adaptive branch-and-bound reduction algorithm for minimizing sum of linear ratios programs
- Optimizing generalized linear fractional program using the image space branch-reduction-bound scheme
- Global branch-reduction-bound algorithm to tackle the sum of the general affine ratios programming
- Spatial algorithm for mixed integer generalized affine multiplicative problems
- A new global optimization method based on separable relaxation for solving sum of linear ratios problem
- Reduced outer space algorithm for globally computing affine sum-of-ratios problems
- A branch-reduction-bound algorithm for linear fractional multi-product planning problems
This page was built for publication: A potential practical algorithm for minimizing the sum of affine fractional functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6106325)
