A branch-bound cut technique for non-linear fractional multi-objective optimization problems
From MaRDI portal
Publication:2657552
DOI10.1007/s40819-020-0771-3zbMath1456.90150OpenAlexW3005638897MaRDI QIDQ2657552
Ram N. Mohapatra, Deepak Bhati, Deepika Agarwal, Pitam Singh
Publication date: 13 March 2021
Published in: International Journal of Applied and Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40819-020-0771-3
nonlinear optimizationdualityoptimal solutionfractional optimizationmulti-objective fractional optimizationbranch-bound
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Fractional programming (90C32)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Global solutions to fractional programming problem with ratio of nonconvex functions
- Using concave envelopes to globally solve the nonlinear sum of ratios problem
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs
- A reference point technique to compute nondominated solutions in MOLFP
- An efficient algorithm for solving convex-convex quadratic fractional programs
- A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem
- An iterative method for solving linear fraction programming (LFP) problem with sensitivity analysis
- Extensions of Dinkelbach's algorithm for solving nonlinear fractional programming problems
- Financial planning with fractional goals
- Solving the sum-of-ratios problem by an interior-point method
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Conical partition algorithm for maximizing the sum of dc ratios
- Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
- Multiobjective integer nonlinear fractional programming problem: a cutting plane approach
- An iterative approach to solve multiobjective linear fractional programming problems
- Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem
- A proposal to the solution of multiobjective linear fractional programming problem
- Optimality criteria for fuzzy-valued fractional multi-objective optimization problem
- A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming
- A modified objective function method for solving nonlinear multiobjective fractional programming problems
- On the optimality of nonlinear fractional disjunctive programming problems
- An interactive method for multiple objective linear fractional programming problems
- NONLINEAR FRACTIONAL PROGRAMMING PROBLEM WITH INEXACT PARAMETER
- Global optimization algorithm for the nonlinear sum of ratios problem
