Extensions of Dinkelbach's algorithm for solving nonlinear fractional programming problems
From MaRDI portal
Recommendations
- Revisiting Dinkelbach-type algorithms for generalized fractional programs
- Generalization of the Dinkelbach-type algorithm for generalized fractional programming
- Generalized fractional programming: Algorithms and numerical experimentation
- Convergence of a Dinkelbach-type algorithm in generalized fractional programming
- A new algorithm for generalized fractional programs
Cites work
- A generalized proximal point algorithm for certain non-convex minimization problems
- A note on integer linear fractional programming
- A Parametric Method for Solving the Linear Fractional Programming Problem
- Bibliography in fractional programming
- Convex Analysis
- Faster parametric shortest path and minimum‐balance algorithms
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 3704369 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- scientific article; zbMATH DE number 47262 (Why is no real title available?)
- scientific article; zbMATH DE number 3383473 (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?)
- Hyperbolic programming
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- On Algorithmic Equivalence in Linear Fractional Programming
- On Nonlinear Fractional Programming
- On Some Properties of Programming Problems in Parametric form Pertaining to Fractional Programming
- On Wolf's method for solving linear fractional programming problem
- Optimal Time-Cost Trade-Offs in GERT Networks
- Optimization of bicriterion quasi-concave function subject to linear constraints
- Partial linearization methods in nonlinear programming
- Programming with linear fractional functionals
- Quadratic programming with one negative eigenvalue is NP-hard
- Restricted simplicial decomposition: Computation and extensions
Cited in
(15)- Revisiting Dinkelbach-type algorithms for generalized fractional programs
- Minimizing a linear fractional function subject to a system of sup-\(T\) equations with a continuous Archimedean triangular norm
- Global optimization of fractional programs
- A surrogate-based cooperative optimization framework for computationally expensive black-box problems
- A branch-bound cut technique for non-linear fractional multi-objective optimization problems
- A variational image segmentation model based on normalized cut with adaptive similarity and spatial regularization
- A sixth bibliography of fractional programming
- Convergence of a Dinkelbach-type algorithm in generalized fractional programming
- Efficient algorithms for solving nonlinear fractional programming problems
- A parametric study for solving nonlinear fractional problems
- Application of fuzzy programming method for solving nonlinear fractional programming problems with fuzzy parameters
- An Accelerated Newton–Dinkelbach Method and Its Application to Two Variables per Inequality Systems
- Dinkelbach Type Approximation Algorithms for Nonlinear Fractional Optimization Problems
- Componentwise Dinkelbach algorithm for nonlinear fractional optimization problems
- Modified Dinkelbach-Type algorithm for generalized fractional programs with infinitely many ratios
This page was built for publication: Extensions of Dinkelbach's algorithm 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 Q1304774)
