Generalized fractional programming and cutting plane algorithms
From MaRDI portal
Publication:1906751
DOI10.1007/BF02192043zbMath0843.90118OpenAlexW2002939850MaRDI QIDQ1906751
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
generalized fractional programcutting plane algorithmboundedly lower subdifferentiable functionsDinkelbach-type procedure
Related Items
A fifth bibliography of fractional programming*, A hybrid method for solving non-convex min–max quadratic fractional problems under quadratic constraints, Modified Dinkelbach-Type algorithm for generalized fractional programs with infinitely many ratios, A new linearization technique for minimax linear fractional programming, A new algorithm for generalized fractional programs, Dual method of centers for solving generalized fractional programs, Minimization of isotonic functions composed of Fractions, Interval division and linearization algorithm for minimax linear fractional program, Application of fuzzy goal programming approach to multi-objective linear fractional inventory model, An effective branch and bound algorithm for minimax linear fractional programming
Cites Work
- Lower subdifferentiable functions and their minimization by cutting planes
- An algorithm for generalized fractional programs
- Fractional programming by lower subdifferentiability techniques
- Generalized fractional programming: Algorithms and numerical experimentation
- The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm
- Fractional programming revisited
- Application of the method of conjugate subgradients to minimization of quasiconvex functions
- Algorithms for generalized fractional programming
- Optimal Server Location on a Network Operating as an M/G/1 Queue
- On Nonlinear Fractional Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item