An algorithm for generalized fractional programs

DOI10.1007/BF00941314zbMATH Open0548.90083OpenAlexW2075978622MaRDI QIDQ799495FDOQ799495

S. Schaible, J.-P. Crouzeix, Jacques A. Ferland

Publication date: 1985

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

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

Recommendations

• A new algorithm for generalized fractional programs
• Algorithms for generalized fractional programming
• A note on an algorithm for generalized fractional programs
• Generic algorithm for generalized fractional programming
• A Fast Algorithm for a Class of Generalized Fractional Programs
• Generalized fractional programming: Algorithms and numerical experimentation
• An \(\varepsilon\)-approximation algorithm for generalized fractional programs
• scientific article
• Revisiting Dinkelbach-type algorithms for generalized fractional programs
• Generalization of the Dinkelbach-type algorithm for generalized fractional programming

zbMATH Keywords

constrained minimumConvergence resultsmaximum of finitely many ratiosmulti-ratio programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Fractional programming (90C32)

Cites Work

• On Nonlinear Fractional Programming
• Fractional programming
• Goal programming and multiple objective optimizations. Part I
• Fractional Programming. II, On Dinkelbach's Algorithm
• Fractional programming
• Parametric approaches to fractional programs
• Bibliography in fractional programming
• Duality in generalized fractional programming via Farkas' lemma
• Duality in generalized linear fractional programming

Cited In (only showing first 100 items - show all)

• Optimality and duality for multiobjective fractional programming involving nonsmooth pseudoinvex functions
• Generalized fractional programming duality: A parametric approach
• Saddle-point type optimality criteria for generalized fractional programming
• Solution of some convex separable resource allocation and production planning problems with bounds on the variables
• A new algorithm for generalized fractional programs
• Method of centers for generalized fractional programming
• Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions
• Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions
• Duality in generalized nonlinear fractional programming
• Duality for generalized fractional programs involving n-set functions
• An inexact proximal point method for solving generalized fractional programs
• Duality for minmax \(B\)-vex programming involving \(n\)-set functions
• A combined algorithm for fractional programming
• Fractional programming
• Linear programming system identification
• Partial linearization for generalized fractional programming
• Dual method of centers for solving generalized fractional programs
• Dual semidefinite programs without duality gaps for a class of convex minimax programs
• Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
• Fractional Programming — Some Recent Developments
• Minimax programming under \((p,r)\)-invexity
• Nonsmooth minimax programming problems withV−r-invex functions
• Generalized fractional programming problems containing locally subdifferentiable andρ-Univex functions
• A modified objective function method for solving nonlinear multiobjective fractional programming problems
• An interior-point method for multifractional programs with convex constraints
• On a dynamic fractional game
• Using duality to solve generalized fractional programming problems
• Three types dual model for minimax fractional programming
• An iterative approach to solve multiobjective linear fractional programming problems
• Prox-dual regularization algorithm for generalized fractional programs
• Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs
• Approximation algorithms for combinatorial fractional programming problems
• Minimization of isotonic functions composed of Fractions
• An entropic regularized method of centers for continuous minimax problem with semi infinite constraints
• Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
• Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions
• Saddle-point-type optimality conditions and lagrangian-type duality for a class of constrained generalized fractional optimal control
• Convergence of Prox-Regularization Methods for Generalized Fractional Programming
• Fritz John Sufficient Optimality Conditions and Duality for a Generalised Minmax Program
• Continuous-time generalized fractional programming
• Optimality conditions and duality for a class of continuous-time generalized fractional programming problems
• A Fourth bibliography of fractional programming
• Minimax programming under generalized \((p, r)\)-invexity
• An SDP approach for quadratic fractional problems with a two-sided quadratic constraint
• Duality without a constraint qualification for minimax fractional programming
• Continuous-time generalized fractional programming problems. Part I: Basic theory
• Title not available (Why is that?)
• A fast approach to deformable surface 3D tracking
• Optimality and duality for multiobjective fractional programming involving nonsmooth($si:F$esi:ρ)–convex functions
• Robust fractional programming
• Title not available (Why is that?)
• Convergence of interval-type algorithms for generalized fractional programming
• Generalized fractional programming and cutting plane algorithms
• On Maximizing a Sum of Ratios
• Nonsmooth minimax programming under locally Lipschitz \((\Phi , \rho )\)-invexity
• A proximal point algorithm for generalized fractional programs
• Convergence of a proximal algorithm for solving the dual of a generalized fractional program
• Prox-regularization of the dual method of centers for generalized fractional programs
• Modified Dinkelbach-Type algorithm for generalized fractional programs with infinitely many ratios
• An incremental and parametrical algorithm for convex-concave fractional programming with a single constraint
• Convergence of a Dinkelbach-type algorithm in generalized fractional programming
• Generic algorithm for generalized fractional programming
• A note on an algorithm for generalized fractional programs
• Revisiting Dinkelbach-type algorithms for generalized fractional programs
• Generalized fractional programming: Algorithms and numerical experimentation
• Optimality and duality for generalized fractional variational problems involving generalized (fρ)-convex functions
• Algorithms for generalized fractional programming
• Generalized fractional minimax programming with \(B-(p,r)\)-invexity
• A new linearization technique for minimax linear fractional programming
• Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs
• A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems
• Title not available (Why is that?)
• Optimality and duality for nonsmooth minimax programming problems using convexifactor
• Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming
• A hybrid method for solving non-convex min–max quadratic fractional problems under quadratic constraints
• Mixed duality without a constraint qualification for minimax fractional programming
• 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
• Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems
• Enhanced bisection strategies for the maximin efficiency ratio model
• Local isolated efficiency in non-smooth robust semi-infinite multi-objective fractional programming problems
• A Bregman proximal subgradient algorithm for nonconvex and nonsmooth fractional optimization problems
• Title not available (Why is that?)
• On quality concepts fractional programming
• Minmax programming : optimality and Wolfe type duality for a problem involving bectovex functions
• Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs
• Optimality and duality for generalized fractional programming involving nonsmooth \((F,\rho)\)-convex functions
• A Cutting Plane Algorithm for Min-Max Fractional Programming
• Saddle-point type optimality criteria and duality relations for generalized fractional programming.
• Augmented Lagrangian dual for nonconvex minimax fractional programs and proximal bundle algorithms for its resolution
• Mond-Weir type duality involving (B, η)-invex functions for a minmax programming problem
• Partial vector invexity and fractional minmax problem
• Parametric nondifferentiable multiobjective fractional programming under (b;;; )-univexity
• Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique
• An effective branch and bound algorithm for minimax linear fractional programming
• Parametric approach to multitime multiobjective fractional variational problems under \((F,\rho)\)-convexity
• Quadratic double-ratio minimax optimization
• A DC approach for minimax fractional optimization programs with ratios of convex functions
• A new branch and bound algorithm for minimax ratios problems
• Optimality and duality results for \(E\)-differentiable multiobjective fractional programming problems under \(E\)-convexity

This page was built for publication: An algorithm for generalized fractional programs

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