Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem
DOI10.1007/S00500-018-3547-5zbMATH Open1415.90111OpenAlexW2893020293MaRDI QIDQ2001124FDOQ2001124
Authors: Deepika Agarwal, Pitam Singh, Deepak Bhati, Saru Kumari, Mohammad S. Obaidat 
Publication date: 2 July 2019
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-018-3547-5
Recommendations
- Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm
- A denominators outcome-space branch and bound algorithm for solving linear fractional sum programming problems
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
- A branch-bound cut technique for non-linear fractional multi-objective optimization problems
- A branch and bound algorithm to globally solve the sum of several linear ratios
dualitybranch and boundmulti-objective linear fractional programmingmulti-objective programmingsum-of-ratio
Multi-objective and goal programming (90C29) Fractional programming (90C32) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Cites Work
- Solving the sum-of-ratios problem by an interior-point method
- Minimization of the ratio of functions defined as sums of the absolute values
- Fractional programming: The sum-of-ratios case
- Global optimization algorithm for the nonlinear sum of ratios problem
- Title not available (Why is that?)
- Duality of a nonconvex sum of ratios
- Solving sum of ratios fractional programs via concave minimization
- A note on the sum of a linear and linear-fractional function
- Using conical partition to globally maximizing the nonlinear sum of ratios
- Global optimization for sum of generalized fractional functions
- Global optimization for sum of linear ratios problem with coefficients
- A practicable branch and bound algorithm for sum of linear ratios problem
- Global optimization of nonlinear sum of 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 simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem
- Solving the sum-of-ratios problems by a harmony search algorithm
- Solving sum of quadratic ratios fractional programs via monotonic function
- Maximizing for the sum of ratios of two convex functions over a convex set
- A global optimization algorithm for sum of linear ratios problem
- A note on the paper ``Global optimization of nonlinear sum of ratios
- An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints
- Generic algorithm for generalized fractional programming
- Global optimization of nonlinear sums of ratios
- Global optimization for a class of nonlinear sum of ratios problem
- Title not available (Why is that?)
Cited In (4)
- A branch-bound cut technique for non-linear fractional multi-objective optimization problems
- Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm
- Stochastic fuzzy multi-level multi-objective fractional programming problem: a FGP approach
- Title not available (Why is that?)
Uses Software
This page was built for publication: Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2001124)
