An effective algorithm for globally solving sum of linear ratios problems

DOI10.1155/2017/8138975MaRDI QIDQ1794234zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Lei Cai, Zhisong Hou, Chunyang Bai, Hong-Wei Jiao

Publication date 15 October 2018

Published in Journal of Control Science and Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2017/8138975

zbMATH Keywords

nonconvex programming problemout space branch-and-bound algorithmout space pruning technique

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Recommendations

• A new global algorithm for the sum of linear ratios problem
• A practicable branch and bound algorithm for sum of linear ratios problem
• A global optimization algorithm for sum of linear ratios problem
• Global optimization algorithm for solving sum of linear ratios problems
• A global optimization algorithm for sum of linear ratios problem

Cites work

• A branch and bound algorithm for globally solving a class of nonconvex programming problems
• A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
• A branch and bound algorithm to globally solve the sum of several linear ratios
• A deterministic global optimization algorithm
• A genetic algorithm using a finite search space for solving nonlinear/linear fractional bilevel programming problems
• A global optimization algorithm for linear fractional programming
• A practicable branch and bound algorithm for sum of linear ratios problem
• A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
• A unified monotonic approach to generalized linear fractional programming
• BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
• Cluster Analysis and Mathematical Programming
• Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
• Global optimization for sum of linear ratios problem with coefficients
• Global solutions to fractional programming problem with ratio of nonconvex functions
• Image space analysis of generalized fractional programs
• On the global optimization of sums of linear fractional functions over a convex set
• Outcome space range reduction method for global optimization of sum of affine ratios problem
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• Programming with linear fractional functionals
• Reduction-branch-bound algorithm for solving sum of linear ratios problems
• Robust fractional programming

Cited in

(6)

• A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension
• A deterministic method for solving the sum of linear ratios problem
• A new linearizing method for sum of linear ratios problem with coefficients
• Effective algorithm and computational complexity for solving sum of linear ratios problem
• A revised algorithm for solving the sum of linear ratios problem with lower dimension using linear relaxation
• A branch and bound algorithm to globally solve the sum of several linear ratios

This page was built for publication: An effective algorithm for globally solving sum of linear ratios problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1794234)