Outcome space range reduction method for global optimization of sum of affine ratios problem

DOI10.1515/math-2016-0058zbMath1349.90692OpenAlexW2533881831MaRDI QIDQ330338

Hong-Wei Jiao, San-Yang Liu, Jingben Yin, Yingfeng Zhao

Publication date: 25 October 2016

Published in: Open Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/math-2016-0058

zbMATH Keywords

global optimizationbranch-and-boundlinear relaxation programrange reduction methodsum of affine ratios

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Fractional programming (90C32)

Related Items (14)

Perturbation of the Moore–Penrose Metric generalized inverse with applications to the best approximate solution problem in L^p(Ω, μ) ⋮ A reduced space branch and bound algorithm for a class of sum of ratios problems ⋮ Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs ⋮ Two-level linear relaxation method for generalized linear fractional programming ⋮ 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 ⋮ Effective algorithm and computational complexity for solving sum of linear ratios problem ⋮ Range division and linearization algorithm for a class of linear ratios optimization problems ⋮ An effective computational algorithm for the global solution of a class of linear fractional programming ⋮ The Sherman–Morrison–Woodbury formula for the Moore–Penrose metric generalized inverse ⋮ An outcome space algorithm for minimizing a class of linear ratio optimization problems ⋮ An effective algorithm for globally solving sum of linear ratios 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

Cites Work

• Unnamed Item
• A practicable branch and bound algorithm for sum of linear ratios problem
• Global optimization algorithm for sum of generalized polynomial ratios problem
• A global optimization algorithm for sum of linear ratios problem
• Range division and compression algorithm for quadratically constrained sum of quadratic ratios
• A deterministic global optimization algorithm
• A note on a deterministic global optimization algorithm
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• Image space analysis of generalized fractional programs
• A unified monotonic approach to generalized linear fractional programming
• Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
• A global optimization algorithm for linear fractional programming
• 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
• A branch and bound algorithm for globally solving a class of nonconvex programming problems
• A branch and bound algorithm to globally solve the sum of several linear ratios
• BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
• BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
• Programming with linear fractional functionals
• The fractional fixed-charge problem
• A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems

This page was built for publication: Outcome space range reduction method for global optimization of sum of affine ratios problem