Reduced outer space algorithm for globally computing affine sum-of-ratios problems
From MaRDI portal
Cites work
- A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems
- A eighth bibliography of fractional programming
- A global optimization algorithm for sum of linear ratios problem
- A hybrid LP/NLP paradigm for global optimization relaxations
- A Nonlinear Programming Algorithm for Hospital Management
- A potential practical algorithm for minimizing the sum of affine fractional functions
- 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 revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems
- A unified monotonic approach to generalized linear fractional programming
- An efficient algorithm and complexity result for solving the sum of general affine ratios problem
- An interior-point method for generalized linear-fractional programming
- An outcome space algorithm for minimizing a class of linear ratio optimization problems
- An Outer Space Approach to Tackle Generalized Affine Fractional Program Problems
- Bibliography: Ninth bibliography of fractional programming
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Effective algorithm and computational complexity for solving sum of linear ratios problem
- scientific article; zbMATH DE number 1095224 (Why is no real title available?)
- Image space branch-reduction-bound algorithm for globally solving the sum of affine ratios problem
- Linear-fractional programming. Theory, methods, applications and software.
- McCormick-Based Relaxations of Algorithms
- Optimizing generalized linear fractional program using the image space branch-reduction-bound scheme
- Outcome space range reduction method for global optimization of sum of affine ratios problem
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Programming with linear fractional functionals
- Range division and linearization algorithm for a class of linear ratios optimization problems
- Solving a (0, 1) hyperbolic program by branch and bound
- Solving generalized polynomial problem by using new affine relaxed technique
- Solving the sum-of-ratios problem by an interior-point method
- Two-level linear relaxation method for generalized linear fractional programming
This page was built for publication: Reduced outer space algorithm for globally computing affine sum-of-ratios problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6900779)
