Efficient algorithms for solving nonlinear fractional programming problems
From MaRDI portal
Publication:5080834
DOI10.2298/FIL1907149DzbMath1499.90240MaRDI QIDQ5080834
Esmaile Khorram, Azam Dolatnezhadsomarin, Latif Pourkarimi
Publication date: 31 May 2022
Published in: Filomat (Search for Journal in Brave)
fractional programming problemPareto optimal solutionbi-objective optimization problemPascoletti-Serafini scalarization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A numerical method for constructing the Pareto front of multi-objective optimization problems
- The normalized normal constraint method for generating the Pareto frontier
- A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
- Celis-Dennis-Tapia based approach to quadratic fractional programming problems with two quadratic constraints
- An algorithm for solving quadratic fractional program with linear homogeneous constraints
- Scalarizations for adaptively solving multi-objective optimization problems
- A simplex algorithm for piecewise-linear fractional programming problems
- SMS-EMOA: multiobjective selection based on dominated hypervolume
- An efficient algorithm for solving convex-convex quadratic fractional programs
- A new procedure for solving linear fractional programming problems
- A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid
- Extension of simplex technique for solving fractional programming problem
- On-line and off-line vertex enumeration by adjacency lists
- Generalized concavity
- Minimization of ratios
- Multicriteria decision making
- Scalarizing vector optimization problems
- An objective space cut and bound algorithm for convex multiplicative programmes
- A new scalarization method for finding the efficient frontier in non-convex multi-objective problems
- A Benson type algorithm for nonconvex multiobjective programming problems
- Fractional programming with convex quadratic forms and functions
- The Simplex Method for Quadratic Programming
- A Successive Approach to Compute the Bounded Pareto Front of Practical Multiobjective Optimization Problems
- An Adaptive Scalarization Method in Multiobjective Optimization
- A Parametric Method for Solving the Linear Fractional Programming Problem
- Parameter-free convex equivalent and dual programs of fractional programming problems
- Multicriteria Optimization
- Programming with linear fractional functionals
- Hyperbolic programming
- Letter to the Editor—Linear Fractional Functionals Programming
- On Nonlinear Fractional Programming
- Algorithmic Equivalence in Linear Fractional Programming
- Linear Programming with a Fractional Objective Function
- Fractional Programming
This page was built for publication: Efficient algorithms for solving nonlinear fractional programming problems