Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem

DOI10.1007/s00500-018-3547-5zbMath1415.90111OpenAlexW2893020293MaRDI QIDQ2001124

Pitam Singh, Mohammad S. Obaidat, Deepak Bhati, Deepika Agarwal, Saru Kumari

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

zbMATH Keywords

dualitybranch and boundmulti-objective programmingmulti-objective linear fractional programmingsum-of-ratio

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Fractional programming (90C32)

Related Items (3)

A branch-bound cut technique for non-linear fractional multi-objective optimization problems ⋮ Unnamed Item ⋮ Stochastic fuzzy multi-level multi-objective fractional programming problem: a FGP approach

Uses Software

• Matlab

Cites Work

• A practicable branch and bound algorithm for sum of linear ratios problem
• Maximizing for the sum of ratios of two convex functions over a convex set
• A global optimization 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
• Generic algorithm for generalized fractional programming
• Duality of a nonconvex sum of ratios
• Solving the sum-of-ratios problem by an interior-point method
• Global optimization for a class of nonlinear sum of ratios problem
• Using conical partition to globally maximizing the nonlinear sum of ratios
• 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
• Solving sum of ratios fractional programs via concave minimization
• Global optimization for sum of generalized fractional functions
• Minimization of the ratio of functions defined as sums of the absolute values
• Global optimization for sum of linear ratios problem with coefficients
• Fractional programming: The sum-of-ratios case
• A note on the sum of a linear and linear-fractional function
• Global optimization of nonlinear sums of ratios
• Global optimization algorithm for the nonlinear sum of ratios problem
• Unnamed Item
• Unnamed Item

This page was built for publication: Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem