Parametric approaches to fractional programs
From MaRDI portal
Publication:4744080
DOI10.1007/BF02591871zbMATH Open0506.90078OpenAlexW2015249958MaRDI QIDQ4744080FDOQ4744080
Authors: Toshihide Ibaraki
Publication date: 1983
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02591871
Newton methodsuperlinear convergencebinary search methodparametric methodscomputational behaviorfractional knapsack problemsmodified binary searchquadratic fractional programs
Cites Work
- On Nonlinear Fractional Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fractional Programming. II, On Dinkelbach's Algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Duality in Fractional Programming: A Unified Approach
- On Some Properties of Programming Problems in Parametric form Pertaining to Fractional Programming
- Title not available (Why is that?)
- ALGORITHMS FOR QUADRATIC FRACTIONAL PROGRAMMING PROBLEMS
- Title not available (Why is that?)
- Experiments with linear fractional problems
Cited In (51)
- Sparse recovery: the square of \(\ell_1/\ell_2\) norms
- Optimality and duality for multiobjective fractional programming involving nonsmooth pseudoinvex functions
- Saddle-point type optimality criteria for generalized fractional programming
- Global optimization for the sum of concave-convex ratios problem
- A new algorithm for generalized fractional programs
- The inverse-parametric knapsack problem
- Method of centers for generalized fractional programming
- A global optimization approach to fractional optimal control
- Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems
- An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints
- A Bregman proximal subgradient algorithm for nonconvex and nonsmooth fractional optimization problems
- Solving the sum-of-ratios problem by a stochastic search algorithm
- Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs
- Fractional 0-1 programming: applications and algorithms
- Fractional Programming — Some Recent Developments
- Solving a class of feature selection problems via fractional 0--1 programming
- Optimality and duality for generalized fractional programming involving nonsmooth \((F,\rho)\)-convex functions
- A global optimization algorithm for sum of quadratic ratios problem with coefficients
- A variable neighborhood search heuristic for the maximum ratio clique problem
- Fractional programming revisited
- Global optimization of fractional programs
- \(\varepsilon\)-optimality and duality for multiobjective fractional programming
- Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games
- Approximation algorithms for combinatorial fractional programming problems
- Partial objective inequalities for the multi-item capacitated lot-sizing problem
- Minimization of isotonic functions composed of Fractions
- The maximum ratio clique problem: A continuous optimization approach and some new results
- On fractional programming containing support functions
- A geometric branch-and-bound algorithm for the service bundle design problem
- On some basic notions of fuzzy parametric nonsmooth multiobjective nonlinear fractional programming problems
- On maximum ratio clique relaxations
- A proximal algorithm with backtracked extrapolation for a class of structured fractional programming
- An SDP approach for quadratic fractional problems with a two-sided quadratic constraint
- The maximum ratio clique problem
- Duality without a constraint qualification for minimax fractional programming
- A MAXIMAL PREDICTABILITY PORTFOLIO MODEL: ALGORITHM AND PERFORMANCE EVALUATION
- Fractional programming with convex quadratic forms and functions
- An efficient algorithm for solving convex-convex quadratic fractional programs
- Optimality and duality for multiobjective fractional programming involving nonsmooth($si:F$esi:ρ)–convex functions
- Fractional programming approach to a cost minimization problem in electricity market
- Conical partition algorithm for maximizing the sum of dc ratios
- Convergence of interval-type algorithms for generalized fractional programming
- An algorithm for generalized fractional programs
- Optimality and duality for a weakly efficient solution of bilevel multiobjective fractional programming problems with extremal-value function
- Processors selection and traffic splitting in a parallel processors system
- Generalized fractional programming: Algorithms and numerical experimentation
- Algorithms for generalized fractional programming
- First-order algorithms for a class of fractional optimization problems
- Analysis of a class of fractional programming problems
- Tow algorithms for finding a minimal ratio hamiltonian cycle in a network
- The quickest flow problem
This page was built for publication: Parametric approaches to fractional programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4744080)