A branch-and-cut algorithm for a class of sum-of-ratios problems
From MaRDI portal
Publication:668157
DOI10.1016/J.AMC.2015.06.089zbMATH Open1410.90210OpenAlexW861127409MaRDI QIDQ668157FDOQ668157
Authors: 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
Recommendations
- Global optimization for the sum of concave-convex ratios problem
- On the global optimization for a class of sum of convex-convex ratios problem
- Maximizing for the sum of ratios of two convex functions over a convex set
- A reduced space branch and bound algorithm for a class of sum of ratios problems
- Global optimization for a class of nonlinear sum of ratios problem
global optimizationbranch-and-cutfractional programmingbranch-and-boundcutting planesemi-infinite optimization
Fractional programming (90C32) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Semi-infinite programming (90C34)
Cites Work
- Title not available (Why is that?)
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- Title not available (Why is that?)
- Solving the sum-of-ratios problem by an interior-point method
- Fractional programming: The sum-of-ratios case
- Semi-Infinite Programming: Theory, Methods, and Applications
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- Global optimization algorithm for the nonlinear sum of ratios problem
- 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
- Finding all solutions of nonlinearly constrained systems of equations
- A global optimization algorithm for linear fractional programming
- Introduction to global optimization.
- A unifying approach to solve some classes of rank-three multiplicative and fractional programs involving linear functions
- A convex analysis approach for convex multiplicative programming
- Title not available (Why is that?)
- Fractional programming: Applications and algorithms
- Image space analysis of generalized fractional programs
- Using conical partition to globally maximizing the nonlinear sum of ratios
- Global optimization of nonlinear sum of ratios problem
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
- Global optimization for the sum of concave-convex ratios problem
- A global optimization algorithm for sum of quadratic ratios problem with coefficients
- An outcome space approach for generalized convex multiplicative programs
- Solving sum-of-ratios fractional programs using efficient points
- Title not available (Why is that?)
- An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
- Global optimization of nonlinear sums of ratios
- On the solution of generalized multiplicative extremum problems
- Global optimization for a class of nonlinear sum of ratios problem
- Generalized Concavity
Cited In (18)
- An effective computational algorithm for the global solution of a class of linear fractional programming
- On solving the sum-of-ratios problem
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
- Title not available (Why is that?)
- Projection heuristics for binary branchings between sum and product
- A branch-and-cut algorithm for the equicut problem
- Title not available (Why is that?)
- A reduced space branch and bound algorithm for a class of sum of ratios problems
- A practicable branch and bound algorithm for sum of linear ratios problem
- An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem
- A practicable contraction approach for the sum of the generalized polynomial ratios problem
- An efficient algorithm and complexity result for solving the sum of general affine ratios problem
- A branch \& cut technique to solve a weighted-sum of linear ratios
- On Maximizing a Sum of Ratios
- 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
- Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm
This page was built for publication: A branch-and-cut algorithm for a class of sum-of-ratios problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q668157)
