A new algorithm for generalized fractional programs

DOI10.1007/BF02592087zbMath0853.90106MaRDI QIDQ1919091

J. B. G. Frenk, Siegfried Schaible, Shu-Zhong Zhang, Ana Isabel Barros

Publication date: 1 August 1996

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

superlinear convergenceKarush-Kuhn-Tucker conditionsquasi-convexityDinkelbach-type algorithmconvex generalized fractional programs

Mathematics Subject Classification ID

Fractional programming (90C32)

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, Using duality to solve generalized fractional programming problems, Prox-dual regularization algorithm for generalized fractional programs, Dual method of centers for solving generalized fractional programs, Minimization of isotonic functions composed of Fractions, 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, Prox-regularization methods for generalized fractional programming, 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, Robust fractional programming, Solution of some convex separable resource allocation and production planning problems with bounds on the variables, Saddle-point type optimality criteria and duality relations for generalized fractional programming., Linear programming system identification, Solving the sum-of-ratios problem by a stochastic search algorithm, Generic algorithm for generalized fractional programming, Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs, Enhanced bisection strategies for the maximin efficiency ratio model

Uses Software

• Algorithm 431

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
• Convergence of interval-type algorithms for generalized fractional programming
• Duality in generalized fractional programming via Farkas' lemma
• Algorithms for generalized fractional programming
• A simple constraint qualification in convex programming
• Generalized fractional programming and cutting plane algorithms
• Duality in generalized linear fractional programming
• Generalized Cheney-Loeb-Dinkelbach-Type Algorithms
• ALGORITHMS FOR QUADRATIC FRACTIONAL PROGRAMMING PROBLEMS
• Parametric approaches to fractional programs
• On Nonlinear Fractional Programming
• Convex Analysis
• Fractional programming
• Fractional programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item