Extensions of Dinkelbach's algorithm for solving nonlinear fractional programming problems

DOI10.1007/BF02564711zbMath0932.90043MaRDI QIDQ1304774

Ricardo G. Ródenas, M. Luz López, Doroteo Verastegui

Publication date: 22 September 1999

Published in: Top (Search for Journal in Brave)

zbMATH Keywords

parametric optimization; nonconvex programming; nonlinear programming; fractional programming; Dinkelbach's algorithm

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90C30: Nonlinear programming

90C31: Sensitivity, stability, parametric optimization

90C32: Fractional programming

Related Items

Minimizing a linear fractional function subject to a system of sup-\(T\) equations with a continuous Archimedean triangular norm, A sixth bibliography of fractional programming

Uses Software

• MINOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization of bicriterion quasi-concave function subject to linear constraints
• Quadratic programming with one negative eigenvalue is NP-hard
• Partial linearization methods in nonlinear programming
• On Wolf's method for solving linear fractional programming problem
• A Parametric Method for Solving the Linear Fractional Programming Problem
• Restricted simplicial decomposition: Computation and extensions
• A note on integer linear fractional programming
• A generalized proximal point algorithm for certain non-convex minimization problems
• On Algorithmic Equivalence in Linear Fractional Programming
• Bibliography in fractional programming
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Programming with linear fractional functionals
• Hyperbolic programming
• On Some Properties of Programming Problems in Parametric form Pertaining to Fractional Programming
• On Nonlinear Fractional Programming
• Convex Analysis
• Optimal Time-Cost Trade-Offs in GERT Networks
• Faster parametric shortest path and minimum‐balance algorithms