Convergence of a Dinkelbach-type algorithm in generalized fractional programming
From MaRDI portal
Publication:3760313
DOI10.1007/BF01258607zbMATH Open0622.90085MaRDI QIDQ3760313FDOQ3760313
Authors: J. Borde, J.-P. Crouzeix 
Publication date: 1987
Published in: Zeitschrift für Operations Research (Search for Journal in Brave)
Recommendations
- Generalization of the Dinkelbach-type algorithm for generalized fractional programming
- Revisiting Dinkelbach-type algorithms for generalized fractional programs
- Convergence of interval-type algorithms for generalized fractional programming
- Extensions of Dinkelbach's algorithm for solving nonlinear fractional programming problems
- Generalized fractional programming and cutting plane algorithms
sensitivityrate of convergencestabilityapproximate solutiongeneralized fractional programmingDinkelbach type algorithm
Numerical mathematical programming methods (65K05) Fractional programming (90C32) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31)
Cites Work
- Programming with linear fractional functionals
- On Nonlinear Fractional Programming
- Determination of the inertia of a partitioned Hermitian matrix
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Fractional programming
- Lipschitzian Solutions of Perturbed Nonlinear Programming Problems
- Fractional Programming. II, On Dinkelbach's Algorithm
- Sensitivity analysis for nonlinear programming using penalty methods
- Title not available (Why is that?)
- Fractional programming: Applications and algorithms
- A first course in numerical analysis.
- The Differential Correction Algorithm for Rational $\ell _\infty $-Approximation
- An algorithm for generalized fractional programs
- A note on an algorithm for generalized fractional programs
- Bibliography in fractional programming
- Duality in generalized linear fractional programming
- Generalized fractional programming: Algorithms and numerical experimentation
- Generalized Cheney-Loeb-Dinkelbach-Type Algorithms
- Title not available (Why is that?)
Cited In (22)
- Generalization of the Dinkelbach-type algorithm for generalized fractional programming
- Generalized Cheney-Loeb-Dinkelbach-Type Algorithms
- Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions
- Interval division and linearization algorithm for minimax linear fractional program
- Duality for generalized fractional programs involving n-set functions
- Fractional programming by lower subdifferentiability techniques
- Partial linearization for generalized fractional programming
- Dinkelbach Type Approximation Algorithms for Nonlinear Fractional Optimization Problems
- A hybrid method for solving non-convex min-max quadratic fractional problems under quadratic constraints
- Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
- Saddle-point-type optimality conditions and lagrangian-type duality for a class of constrained generalized fractional optimal control
- Continuous-time generalized fractional programming
- Optimality conditions and duality for a class of continuous-time generalized fractional programming problems
- A Fourth bibliography of fractional programming
- A new branch and bound algorithm for minimax ratios problems
- Convergence of interval-type algorithms for generalized fractional programming
- Convergence of a proximal algorithm for solving the dual of a generalized fractional program
- Modified Dinkelbach-Type algorithm for generalized fractional programs with infinitely many ratios
- Revisiting Dinkelbach-type algorithms for generalized fractional programs
- Algorithms for generalized fractional programming
- An Accelerated Newton–Dinkelbach Method and Its Application to Two Variables per Inequality Systems
- A fuzzy approach using generalized Dinkelbach's algorithm for multiobjective linear fractional transportation problem
This page was built for publication: Convergence of a Dinkelbach-type algorithm in generalized fractional programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3760313)
