A branch-bound cut technique for non-linear fractional multi-objective optimization problems
From MaRDI portal
Publication:2657552
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
Cites work
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- A modified objective function method for solving nonlinear multiobjective fractional programming problems
- A proposal to the solution of multiobjective linear fractional programming problem
- A reference point technique to compute nondominated solutions in MOLFP
- A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming
- A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- An efficient algorithm for solving convex-convex quadratic fractional programs
- An interactive method for multiple objective linear fractional programming problems
- An iterative approach to solve multiobjective linear fractional programming problems
- An iterative method for solving linear fraction programming (LFP) problem with sensitivity analysis
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional 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
- Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem
- Extensions of Dinkelbach's algorithm for solving nonlinear fractional programming problems
- Financial planning with fractional goals
- Global optimization algorithm for the nonlinear sum of ratios problem
- Global solutions to fractional programming problem with ratio of nonconvex functions
- Multiobjective integer nonlinear fractional programming problem: a cutting plane approach
- Nonlinear fractional programming problem with inexact parameter
- On the optimality of nonlinear fractional disjunctive programming problems
- Optimality criteria for fuzzy-valued fractional multi-objective optimization problem
- Solving the sum-of-ratios problem by an interior-point method
- Using concave envelopes to globally solve the nonlinear sum of ratios problem
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
- scientific article; zbMATH DE number 7547172 (Why is no real title available?)
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)
