An effective algorithm for globally solving sum of linear ratios problems

DOI10.1155/2017/8138975zbMath1408.90242OpenAlexW2622684914WikidataQ59145638 ScholiaQ59145638MaRDI QIDQ1794234

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

Publication date: 15 October 2018

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

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

zbMATH Keywords

out space branch-and-bound algorithmnonconvex programming problemout space pruning technique

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A genetic algorithm using a finite search space for solving nonlinear/linear fractional bilevel programming problems
• Global solutions to fractional programming problem with ratio of nonconvex functions
• 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
• Robust fractional programming
• On the global optimization of sums of linear fractional functions over a convex set
• A deterministic global optimization algorithm
• 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
• 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
• 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 PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
• Programming with linear fractional functionals
• Cluster Analysis and Mathematical Programming
• A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems

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