On the global optimization of sums of linear fractional functions over a convex set
From MaRDI portal
(Redirected from Publication:704748)
Recommendations
- Optimizing of sums and products of linear fractional functions under linear constraints
- Global optimization for sum of generalized fractional functions
- Global optimization for sum of geometric fractional functions
- A deterministic global optimization method for solving linear fractional programming
- Global optimization for the sum of generalized polynomial fractional functions
Cites work
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- scientific article; zbMATH DE number 1342815 (Why is no real title available?)
- scientific article; zbMATH DE number 757682 (Why is no real title available?)
- scientific article; zbMATH DE number 1445369 (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 for maximizing the sum of several linear ratios
- A global optimization algorithm for linear fractional and bilinear programs
- A note on the sum of a linear and linear-fractional function
- An algorithm for nonconvex programming problems
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
- Convex Analysis
- Decomposition approach for the global minimization of biconcave functions over polytopes
- Deterministic algorithms for constrained concave minimization: A unified critical survey
- Generating sum-of-ratios test problems in global optimization
- Global minimization of a generalized convex multiplicative function
- Handbook of global optimization
- Image space analysis of generalized fractional programs
- Minimization of the sum of three linear fractional functions
- On Maximizing a Sum of Ratios
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Primal-relaxed dual global optimization approach
- Programming with linear fractional functionals
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
Cited in
(38)- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- Global optimization for the sum of concave-convex ratios problem
- An effective computational algorithm for the global solution of a class of linear fractional programming
- An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints
- Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems
- Maximizing the sum of a generalized Rayleigh quotient and another Rayleigh quotient on the unit sphere via semidefinite programming
- A deterministic method for solving the sum of linear ratios problem
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
- Global optimization for the sum of certain nonlinear functions
- Solving the sum-of-ratios problem by a stochastic search algorithm
- Global optimization for sum of geometric fractional functions
- An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications
- A review of recent advances in global optimization
- scientific article; zbMATH DE number 1342815 (Why is no real title available?)
- Global solutions to fractional programming problem with ratio of nonconvex functions
- A global optimization algorithm for sum of quadratic ratios problem with coefficients
- An approach for minimizing a quadratically constrained fractional quadratic problem with application to the communications over wireless channels
- Solution approaches to linear fractional programming and its stochastic generalizations using second order cone approximations
- A practicable branch and bound algorithm for sum of linear ratios problem
- Global optimization of generalized linear fractional programming with nonlinear constraints
- Global optimization for a class of fractional programming problems
- Optimization of chance constraint programming with sum-of-fractional objectives â an application to assembled printed circuit board problem
- Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problems
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs
- An effective algorithm for globally solving sum of linear ratios problems
- An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem
- The attractive traveling salesman problem
- Solving sum of quadratic ratios fractional programs via monotonic function
- Globally minimizing the sum of a convex-concave fraction and a convex function based on wave-curve bounds
- An efficient algorithm and complexity result for solving the sum of general affine ratios problem
- A sixth bibliography of fractional programming
- Solving sum of ratios fractional programs via concave minimization
- A global optimization algorithm for linear fractional and bilinear programs
- A new deterministic global computing algorithm for solving a kind of linear fractional programming
- Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm
- A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation
- Global optimization for sum of generalized fractional functions
- Global optimization for sum of linear ratios problem with coefficients
This page was built for publication: On the global optimization of sums of linear fractional functions over a convex set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q704748)
