Generalized fractional programming and cutting plane algorithms

DOI10.1007/BF02192043zbMATH Open0843.90118OpenAlexW2002939850MaRDI QIDQ1906751FDOQ1906751

Authors J. B. G. Frenk, Ana Isabel Barros

Publication date 6 February 1996

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02192043

zbMATH Keywords

generalized fractional programcutting plane algorithmboundedly lower subdifferentiable functionsDinkelbach-type procedure

Mathematics Subject Classification ID

Fractional programming (90C32)

Recommendations

• Generalization of the Dinkelbach-type algorithm for generalized fractional programming
• A Cutting Plane Algorithm for Min-Max Fractional Programming
• scientific article; zbMATH DE number 4176856
• Generalized fractional programming: Algorithms and numerical experimentation
• Revisiting Dinkelbach-type algorithms for generalized fractional programs

Cites work

• scientific article; zbMATH DE number 3819468 (Why is no real title available?)
• scientific article; zbMATH DE number 4048492 (Why is no real title available?)
• scientific article; zbMATH DE number 3793743 (Why is no real title available?)
• scientific article; zbMATH DE number 592626 (Why is no real title available?)
• Algorithms for generalized fractional programming
• An algorithm for generalized fractional programs
• Application of the method of conjugate subgradients to minimization of quasiconvex functions
• Fractional programming by lower subdifferentiability techniques
• Fractional programming revisited
• Generalized fractional programming: Algorithms and numerical experimentation
• Lower subdifferentiable functions and their minimization by cutting planes
• On Nonlinear Fractional Programming
• Optimal Server Location on a Network Operating as an M/G/1 Queue
• The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm

Cited in

(18)

• Application of fuzzy goal programming approach to multi-objective linear fractional inventory model
• A Cutting Plane Algorithm for Min-Max Fractional Programming
• scientific article; zbMATH DE number 4176856 (Why is no real title available?)
• The generalized good cut equation
• A fifth bibliography of fractional programming^*
• An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications
• Global algorithm for effectively solving min-max affine fractional programs
• Interval division and linearization algorithm for minimax linear fractional program
• An effective branch and bound algorithm for minimax linear fractional programming
• A hybrid method for solving non-convex min-max quadratic fractional problems under quadratic constraints
• Minimization of isotonic functions composed of Fractions
• Convergence of a Dinkelbach-type algorithm in generalized fractional programming
• Fractional programming by lower subdifferentiability techniques
• A new algorithm for generalized fractional programs
• Dual method of centers for solving generalized fractional programs
• Modified Dinkelbach-Type algorithm for generalized fractional programs with infinitely many ratios
• A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming
• A new linearization technique for minimax linear fractional programming

This page was built for publication: Generalized fractional programming and cutting plane algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1906751)