Outcome space range reduction method for global optimization of sum of affine ratios problem
From MaRDI portal
(Redirected from Publication:330338)
Recommendations
- A reduced space branch and bound algorithm for a class of sum of ratios problems
- Reduction-branch-bound algorithm for solving sum of linear ratios problems
- Global optimization for a class of nonlinear sum of ratios problem
- Global optimization of nonlinear sum of ratios problem
- Global optimization of nonlinear sums of ratios
Cites work
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- 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 global optimization algorithm for linear fractional programming
- A global optimization algorithm for sum of linear ratios problem
- A note on a deterministic global optimization algorithm
- A practicable branch and bound algorithm for sum of linear ratios problem
- A unified monotonic approach to generalized linear fractional programming
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- 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
- Image space analysis of generalized fractional programs
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Programming with linear fractional functionals
- Range division and compression algorithm for quadratically constrained sum of quadratic ratios
- The fractional fixed-charge problem
Cited in
(14)- The Sherman-Morrison-Woodbury formula for the Moore-Penrose metric generalized inverse
- 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
- An outcome space algorithm for minimizing a class of linear ratio optimization problems
- Two-level linear relaxation method for generalized linear fractional programming
- Effective algorithm and computational complexity for solving sum of linear ratios problem
- A reduced space branch and bound algorithm for a class of sum of ratios problems
- An effective algorithm for globally solving sum of linear ratios problems
- Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
- An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem
- A new deterministic global computing algorithm for solving a kind of linear fractional programming
- Perturbation of the Moore-Penrose metric generalized inverse with applications to the best approximate solution problem in \(L^p(\Omega, \mu )\)
- Range division and linearization algorithm for a class of linear ratios optimization problems
This page was built for publication: Outcome space range reduction method for global optimization of sum of affine ratios problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q330338)
