Solving sum-of-ratios fractional programs using efficient points

DOI10.1080/02331930108844543zbMath1006.90081OpenAlexW1971847617MaRDI QIDQ2743661

Nguyen Van Thoai, Mirjam Dür, Reiner Horst

Publication date: 30 July 2002

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

fractional programmingbranch and bound algorithmsmulticriteria optimization

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Fractional programming (90C32)

Related Items

A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem, On solving the sum-of-ratios problem, A new deterministic global computing algorithm for solving a kind of linear fractional programming, A branch-and-cut algorithm for a class of sum-of-ratios problems, A sequential method for a class of pseudoconcave fractional problems, Solving sum of ratios fractional programs via concave minimization, Solving fractional problems with dynamic multistart improving hit-and-run, Allocation policy for testing effort of modular software system under budgetary constraint, An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem, Solving the sum-of-ratios problems by a harmony search algorithm, Probabilistic subproblem selection in branch-and-bound algorithms, Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs, On maximizing the adoption of multi-products in multiple market segments, Determining the optimal allocation of testing resource for modular software system using dynamic programming, Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problems, A sixth bibliography of fractional programming, A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems

Cites Work

• Unnamed Item
• Image space analysis of generalized fractional programs
• Optimization on low rank nonconvex structures
• Lagrange duality and partitioning techniques in nonconvex global optimization
• Introduction to global optimization
• New LP bound in multivariate Lipschitz optimization: Theory and applications
• Linearly constrained global minimization of functions with concave minorants
• Queueing-location problems on the plane
• On Maximizing a Sum of Ratios
• Fractional Programming. I, Duality
• Programming with linear fractional functionals
• A Class of Fractional Programming Problems