A branch-bound cut technique for non-linear fractional multi-objective optimization problems
DOI10.1007/S40819-020-0771-3zbMATH Open1456.90150OpenAlexW3005638897MaRDI QIDQ2657552FDOQ2657552
Authors: Pitam Singh, Deepika Agarwal, Deepak Bhati, Ram N. Mohapatra 
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
Recommendations
- Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm
- Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem
- Multiobjective integer nonlinear fractional programming problem: a cutting plane approach
- A class of nonsmooth fractional multiobjective optimization problems
- A modified objective function method for solving nonlinear multiobjective fractional programming problems
- scientific article; zbMATH DE number 6160749
- A compromise procedure for the multiple objective linear fractional programming problem
- Optimality for nonsmooth fractional multiple objective programming
- scientific article; zbMATH DE number 6907481
- An effective branch and bound algorithm for minimax linear fractional programming
nonlinear optimizationdualityoptimal solutionfractional optimizationmulti-objective fractional optimizationbranch-bound
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
- Multiobjective integer nonlinear fractional programming problem: a cutting plane approach
- An iterative approach to solve multiobjective linear fractional programming problems
- Global optimization algorithm for the nonlinear sum of ratios problem
- Using concave envelopes to globally solve the nonlinear sum of ratios problem
- Title not available (Why is that?)
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Global solutions to fractional programming problem with ratio of nonconvex functions
- Conical partition algorithm for maximizing the sum of dc ratios
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs
- A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem
- An efficient algorithm for solving convex-convex quadratic fractional programs
- A modified objective function method for solving nonlinear multiobjective fractional programming problems
- Financial planning with fractional goals
- Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization 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
- On the optimality of nonlinear fractional disjunctive programming problems
- A reference point technique to compute nondominated solutions in MOLFP
- Extensions of Dinkelbach's algorithm for solving nonlinear fractional programming problems
- An interactive method for multiple objective linear fractional programming problems
- An iterative method for solving linear fraction programming (LFP) problem with sensitivity analysis
- A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming
- Optimality criteria for fuzzy-valued fractional multi-objective optimization problem
- Nonlinear fractional programming problem with inexact parameter
Cited In (5)
- A piecewise convexification method for non-convex multi-objective optimization programs with box constraints
- A radial boundary intersection aided interior point method for multi-objective optimization
- Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem
- Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm
- Title not available (Why is that?)
Uses Software
This page was built for publication: A branch-bound cut technique for non-linear fractional multi-objective optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2657552)
