Using duality to solve generalized fractional programming problems
From MaRDI portal
Publication:1924069
DOI10.1007/BF00138690zbMath0858.90126OpenAlexW2015973352MaRDI QIDQ1924069
J. B. G. Frenk, Ana Isabel Barros, Shu-Zhong Zhang, Siegfried Schaible
Publication date: 23 March 1997
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00138690
Related Items
A DC approach for minimax fractional optimization programs with ratios of convex functions, Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions, A fifth bibliography of fractional programming*, An entropic regularized method of centers for continuous minimax problem with semi infinite constraints, A proximal point algorithm for generalized fractional programs, Convergence of a proximal algorithm for solving the dual of a generalized fractional program, Prox-dual regularization algorithm for generalized fractional programs, Duality for multiobjective fractional programming problem using convexifactors, Dual method of centers for solving generalized fractional programs, Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs, Augmented Lagrangian dual for nonconvex minimax fractional programs and proximal bundle algorithms for its resolution, Robust duality for fractional programming problems with constraint-wise data uncertainty, Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs, Prox-regularization of the dual method of centers for generalized fractional programs, Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions, Linear programming system identification, Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs, An effective branch and bound algorithm for minimax linear fractional programming, Strong duality for robust minimax fractional programming problems, Enhanced bisection strategies for the maximin efficiency ratio model, On \(\epsilon\)-solutions for robust fractional optimization problems
Uses Software
Cites Work
- On general minimax theorems
- An algorithm for generalized fractional programs
- Generalized fractional programming: Algorithms and numerical experimentation
- A note on an algorithm for generalized fractional programs
- Fractional programming - a survey
- Convergence of interval-type algorithms for generalized fractional programming
- Duality in generalized fractional programming via Farkas' lemma
- Algorithms for generalized fractional programming
- Global optimization of fractional programs
- Generalized concavity
- A new algorithm for generalized fractional programs
- Duality in generalized linear fractional programming
- Programming with linear fractional functionals
- On Nonlinear Fractional Programming
- Convex Analysis
- Fractional programming
- Fractional programming
- Sufficient conditions for extremum, penalty functions and regularity
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
