A branch-and-cut algorithm for a class of sum-of-ratios problems
From MaRDI portal
Publication:668157
DOI10.1016/j.amc.2015.06.089zbMath1410.90210OpenAlexW861127409MaRDI QIDQ668157
Alireza M. Ashtiani, Paulo Augusto Valente Ferreira
Publication date: 18 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2015.06.089
global optimizationbranch-and-boundfractional programmingcutting planebranch-and-cutsemi-infinite optimization
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Fractional programming (90C32) Semi-infinite programming (90C34)
Related Items (9)
Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm ⋮ An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem ⋮ An efficient algorithm and complexity result for solving the sum of general affine ratios problem ⋮ On solving the sum-of-ratios problem ⋮ Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems ⋮ A new deterministic global computing algorithm for solving a kind of linear fractional programming ⋮ A practicable contraction approach for the sum of the generalized polynomial ratios problem ⋮ An effective computational algorithm for the global solution of a class of linear fractional programming ⋮ An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A global optimization algorithm for sum of quadratic ratios problem with coefficients
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- Using concave envelopes to globally solve the nonlinear sum of ratios problem
- On the solution of generalized multiplicative extremum problems
- Global optimization of nonlinear sum of ratios problem
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
- A convex analysis approach for convex multiplicative programming
- An outcome space approach for generalized convex multiplicative programs
- A unifying approach to solve some classes of rank-three multiplicative and fractional programs involving linear functions
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- Fractional programming: Applications and algorithms
- Image space analysis of generalized fractional programs
- An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
- Solving the sum-of-ratios problem by an interior-point method
- Global optimization for a class of nonlinear sum of ratios problem
- Finding all solutions of nonlinearly constrained systems of equations
- Using conical partition to globally maximizing the nonlinear sum of ratios
- Global optimization for the sum of concave-convex ratios problem
- A global optimization algorithm for linear fractional programming
- Solving sum-of-ratios fractional programs using efficient points
- Fractional programming: The sum-of-ratios case
- Generalized Concavity
- Semi-Infinite Programming: Theory, Methods, and Applications
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- Introduction to global optimization.
- Global optimization of nonlinear sums of ratios
- Global optimization algorithm for the nonlinear sum of ratios problem
This page was built for publication: A branch-and-cut algorithm for a class of sum-of-ratios problems
