Solving sum-of-ratios fractional programs using efficient points

DOI10.1080/02331930108844543MaRDI QIDQ2743661zbMATH OpenOpenAlexFDO

Authors Mirjam Dür, Nguyen Van Thoai, 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

branch and bound algorithmsfractional programmingmulticriteria optimization

Mathematics Subject Classification ID

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

Recommendations

• Solving sum of ratios fractional programs via concave minimization
• Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs
• Global optimization algorithm for the nonlinear sum of ratios problem
• An Efficient algorithm for quadratic sum-of-ratios fractional programs problem
• Global optimization of nonlinear sum of ratios problem

Cites work

• A Class of Fractional Programming Problems
• Fractional Programming. I, Duality
• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• Image space analysis of generalized fractional programs
• Introduction to global optimization
• Lagrange duality and partitioning techniques in nonconvex global optimization
• Linearly constrained global minimization of functions with concave minorants
• New LP bound in multivariate Lipschitz optimization: Theory and applications
• On Maximizing a Sum of Ratios
• Optimization on low rank nonconvex structures
• Programming with linear fractional functionals
• Queueing-location problems on the plane

Cited in

(20)

• On solving the sum-of-ratios problem
• Solving sum of ratios fractional programs via concave minimization
• Solving fractional problems with dynamic multistart improving hit-and-run
• A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems
• 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
• Allocation policy for testing effort of modular software system under budgetary constraint
• A sixth bibliography of fractional programming
• An Efficient algorithm for quadratic sum-of-ratios fractional programs problem
• On maximizing the adoption of multi-products in multiple market segments
• Probabilistic subproblem selection in branch-and-bound algorithms
• A new deterministic global computing algorithm for solving a kind of linear fractional programming
• An algorithm for stochastic convex-concave fractional programs with applications to production efficiency and equitable resource allocation
• A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation
• A branch-and-cut algorithm for a class of sum-of-ratios problems
• An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem
• Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs
• A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
• A sequential method for a class of pseudoconcave fractional problems
• Solving the sum-of-ratios problems by a harmony search algorithm

This page was built for publication: Solving sum-of-ratios fractional programs using efficient points

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