Efficient algorithms for solving nonlinear fractional programming problems
From MaRDI portal
Recommendations
- An efficient algorithm for solving a class of fractional programming problems
- An Algorithm for a Class of Nonconvex Programming Problems with Nonlinear Fractional Objectives
- An algorithm for solving linear fractional programming problems
- Extensions of Dinkelbach's algorithm for solving nonlinear fractional programming problems
- Algorithms for generalized fractional programming
- Approaches for solving a class of non-differentiable non-linear fractional programming problems
- scientific article; zbMATH DE number 857647
- scientific article; zbMATH DE number 409486
- An efficient algorithm for solving convex-convex quadratic fractional programs
- An effective computational algorithm for the global solution of a class of linear fractional programming
Cites work
- scientific article; zbMATH DE number 1095224 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- scientific article; zbMATH DE number 3407452 (Why is no real title available?)
- scientific article; zbMATH DE number 3197631 (Why is no real title available?)
- A Benson type algorithm for nonconvex multiobjective programming problems
- A Parametric Method for Solving the Linear Fractional Programming Problem
- A Successive Approach to Compute the Bounded Pareto Front of Practical Multiobjective Optimization Problems
- A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid
- A new procedure for solving linear fractional programming problems
- A new scalarization method for finding the efficient frontier in non-convex multi-objective problems
- A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
- A numerical method for constructing the Pareto front of multi-objective optimization problems
- A simplex algorithm for piecewise-linear fractional programming problems
- Algorithmic Equivalence in Linear Fractional Programming
- An Adaptive Scalarization Method in Multiobjective Optimization
- An algorithm for solving quadratic fractional program with linear homogeneous constraints
- An efficient algorithm for solving convex-convex quadratic fractional programs
- An objective space cut and bound algorithm for convex multiplicative programmes
- Celis-Dennis-Tapia based approach to quadratic fractional programming problems with two quadratic constraints
- Extension of simplex technique for solving fractional programming problem
- Fractional Programming
- Fractional programming with convex quadratic forms and functions
- Generalized concavity
- Hyperbolic programming
- Letter to the Editor—Linear Fractional Functionals Programming
- Linear Programming with a Fractional Objective Function
- Minimization of ratios
- Multicriteria Optimization
- Multicriteria decision making
- On Nonlinear Fractional Programming
- On-line and off-line vertex enumeration by adjacency lists
- Parameter-free convex equivalent and dual programs of fractional programming problems
- Programming with linear fractional functionals
- SMS-EMOA: multiobjective selection based on dominated hypervolume
- Scalarizations for adaptively solving multi-objective optimization problems
- Scalarizing vector optimization problems
- Solving LFP by converting it into a single LP
- Solving linear fractional programming problems with interval coefficients in the objective function. A new approach
- The Simplex Method for Quadratic Programming
- The normalized normal constraint method for generating the Pareto frontier
This page was built for publication: Efficient algorithms for solving nonlinear fractional programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5080834)
