An Efficient Algorithm for Quadratic Sum-of-Ratios Fractional Programs Problem

DOI10.1080/01630563.2017.1327869zbMath1387.90243OpenAlexW2614903804MaRDI QIDQ4602158

Hong-Wei Jiao, San-Yang Liu

Publication date: 26 January 2018

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630563.2017.1327869

zbMATH Keywords

global optimizationfractional programsbranch-and-boundparametric linearizing techniquequadratic sum-of-ratios

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Fractional programming (90C32)

Related Items (17)

Perturbation of the Moore–Penrose Metric generalized inverse with applications to the best approximate solution problem in L^p(Ω, μ) ⋮ A parametric linearizing approach for quadratically inequality constrained quadratic programs ⋮ Solving generalized polynomial problem by using new affine relaxed technique ⋮ A reduced space branch and bound algorithm for a class of sum of ratios problems ⋮ A solution approach for cardinality minimization problem based on fractional programming ⋮ Perturbation bounds for the metric projection of a point onto a linear manifold in reflexive strictly convex Banach spaces ⋮ Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs ⋮ Two-level linear relaxation method for generalized linear fractional programming ⋮ An accelerating outer space algorithm for globally solving generalized linear multiplicative problems ⋮ An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming ⋮ A practicable contraction approach for the sum of the generalized polynomial ratios problem ⋮ The Sherman–Morrison–Woodbury formula for the Moore–Penrose metric generalized inverse ⋮ An effective algorithm for globally solving quadratic programs using parametric linearization technique ⋮ An outcome space algorithm for minimizing a class of linear ratio optimization problems ⋮ Outer space branch and bound algorithm for solving linear multiplicative programming problems ⋮ 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

This page was built for publication: An Efficient Algorithm for Quadratic Sum-of-Ratios Fractional Programs Problem