Global optimization of quadratic fractional programming using linear relaxation method
From MaRDI portal
Cites work
- A global optimization algorithm for sum of quadratic ratios problem with coefficients
- A novel approach for solving quadratic fractional programming problems
- A Parametric Method for Solving the Linear Fractional Programming Problem
- A potential practical algorithm for minimizing the sum of affine fractional functions
- An algorithm for solving quadratic fractional program with linear homogeneous constraints
- An efficient algorithm and complexity result for solving the sum of general affine ratios problem
- An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
- Duality and Sensitivity Analysis for Fractional Programs
- Global optimization algorithm for sum of generalized polynomial ratios problem
- Global optimization for the generalized polynomial sum of ratios problem
- Global optimization for the sum of generalized polynomial fractional functions
- Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region
- Global optimization of nonlinear sum of ratios problem
- Globally minimizing a class of fractional multiplicative problems using the separability of relaxation problem
- scientific article; zbMATH DE number 3197631 (Why is no real title available?)
- Maximization of the ratio of two convex quadratic functions over a polytope
- On Nonlinear Fractional Programming
- Optimization of polynomial fractional functions
- Outcome-space based B{\&}B algorithm for min-max affine fractional programs through a series of linear relaxation techniques to solve large-size problems
- Programming with linear fractional functionals
- Range division and compression algorithm for quadratically constrained sum of quadratic ratios
- Solving sum of quadratic ratios fractional programs via monotonic function
- Spatial algorithm for mixed integer generalized affine multiplicative problems
This page was built for publication: Global optimization of quadratic fractional programming using linear relaxation method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7446671)