Generalized fractional programming and cutting plane algorithms
From MaRDI portal
DOI10.1007/BF02192043zbMATH Open0843.90118OpenAlexW2002939850MaRDI QIDQ1906751FDOQ1906751
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
Recommendations
- Generalization of the Dinkelbach-type algorithm for generalized fractional programming
- A Cutting Plane Algorithm for Min-Max Fractional Programming
- scientific article
- Generalized fractional programming: Algorithms and numerical experimentation
- Revisiting Dinkelbach-type algorithms for generalized fractional programs
generalized fractional programcutting plane algorithmboundedly lower subdifferentiable functionsDinkelbach-type procedure
Cites Work
- On Nonlinear Fractional Programming
- Fractional programming revisited
- Title not available (Why is that?)
- An algorithm for generalized fractional programs
- Lower subdifferentiable functions and their minimization by cutting planes
- Title not available (Why is that?)
- Optimal Server Location on a Network Operating as an M/G/1 Queue
- Algorithms for generalized fractional programming
- The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm
- Fractional programming by lower subdifferentiability techniques
- Generalized fractional programming: Algorithms and numerical experimentation
- Title not available (Why is that?)
- Application of the method of conjugate subgradients to minimization of quasiconvex functions
- Title not available (Why is that?)
Cited In (18)
- A new algorithm for generalized fractional programs
- A hybrid method for solving non-convex min–max quadratic fractional problems under quadratic constraints
- A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming
- Interval division and linearization algorithm for minimax linear fractional program
- Fractional programming by lower subdifferentiability techniques
- 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
- Dual method of centers for solving generalized fractional programs
- A Cutting Plane Algorithm for Min-Max Fractional Programming
- Minimization of isotonic functions composed of Fractions
- An effective branch and bound algorithm for minimax linear fractional programming
- Title not available (Why is that?)
- Application of fuzzy goal programming approach to multi-objective linear fractional inventory model
- The generalized good cut equation
- Modified Dinkelbach-Type algorithm for generalized fractional programs with infinitely many ratios
- Convergence of a Dinkelbach-type algorithm in generalized fractional programming
- A fifth bibliography of 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)