On solving the sum-of-ratios problem
From MaRDI portal
Publication:2422872
DOI10.1016/j.amc.2017.07.074zbMath1426.90205OpenAlexW2745612518MaRDI QIDQ2422872
Tatiana V. Gruzdeva, Alexander S. Strekalovsky
Publication date: 21 June 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2017.07.074
difference of convex functionsnonconvex optimizationglobal search algorithmfractional optimizationequation with vector parameter
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Fractional programming (90C32)
Related Items (6)
A solution approach for cardinality minimization problem based on fractional programming ⋮ Joint location and cost planning in maximum capture facility location under random utilities ⋮ Foreword to the special issue ``Recent trends in numerical computations: theory and algorithms ⋮ A practicable contraction approach for the sum of the generalized polynomial ratios problem ⋮ Range division and linearization algorithm for a class of linear ratios optimization problems ⋮ Fractional programming approach to a cost minimization problem in electricity market
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimizing the sum of many rational functions
- On the problem polyhedral separability: a numerical solution
- On local search in d.c. optimization problems
- A branch-and-cut algorithm for a class of sum-of-ratios problems
- A simplex algorithm for piecewise-linear fractional programming problems
- Solving the sum-of-ratios problem by a stochastic search algorithm
- Solving the sum-of-ratios problem by an interior-point method
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints
- Global optimality conditions in nonconvex optimization
- On a local and global search involved in nonconvex optimization problems
- Solving sum-of-ratios fractional programs using efficient points
- On Solving Optimization Problems with Hidden Nonconvex Structures
- Fractional programming: The sum-of-ratios case
- An Approach to Fractional Programming via D.C. Constraints Problem: Local Search
- Queueing-location problems on the plane
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
- Local search in problems with nonconvex constraints
- On Nonlinear Fractional Programming
- Cluster Analysis and Mathematical Programming
- Fractional Programming
- Mathematical tools for data mining. Set theory, partial orders, combinatorics
- Convex analysis and global optimization
- Global optimization algorithm for the nonlinear sum of ratios problem
This page was built for publication: On solving the sum-of-ratios problem
