Effective algorithm and computational complexity for solving sum of linear ratios problem

DOI10.3934/jimo.2022135OpenAlexW4289538304MaRDI QIDQ2691389

Junqiao Ma, Yongjian Qiu, Pei-Ping Shen, Hong-Wei Jiao

Publication date: 29 March 2023

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2022135

zbMATH Keywords

global optimizationbranch-and-bound algorithmfractional programmingsum of linear ratioslinearization technique

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Fractional programming (90C32)

Related Items (1)

An accelerating outer space algorithm for globally solving generalized linear multiplicative problems

Uses Software

• WinGULF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A practicable branch and bound algorithm for sum of linear ratios problem
• Outcome space range reduction method for global optimization of sum of affine ratios problem
• A global optimization algorithm for sum of linear ratios problem
• A branch-and-bound algorithm for maximizing the sum of several linear ratios
• Using concave envelopes to globally solve the nonlinear sum of ratios problem
• Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs
• Regional division and reduction algorithm for minimizing the sum of linear fractional functions
• A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• Image space analysis of generalized fractional programs
• Linear-fractional programming. Theory, methods, applications and software.
• A unified monotonic approach to generalized linear fractional programming
• Solving the sum-of-ratios problem by an interior-point method
• Range division and linearization algorithm for a class of linear ratios optimization problems
• An interior-point method for generalized linear-fractional programming
• Solving a class of generalized fractional programming problems using the feasibility of linear programs
• A practicable contraction approach for the sum of the generalized polynomial ratios problem
• A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension
• Global optimization for sum of linear ratios problem with coefficients
• A eighth bibliography of fractional programming
• BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
• BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
• Solving generalized polynomial problem by using new affine relaxed technique
• Image space branch-reduction-bound algorithm for globally minimizing a class of multiplicative problems
• Cluster Analysis and Mathematical Programming
• Global optimization algorithm for the nonlinear sum of ratios problem

This page was built for publication: Effective algorithm and computational complexity for solving sum of linear ratios problem