A parametric solution method for a generalized fractional programming problem
type: Item
instance of: scholarly article
title: A parametric solution method for a generalized fractional programming problem
zbMATH Open document ID: 1477.90111
author: YunChol Jong
author: J. W. Yu
author: Yong-Jin Kim
published in: Indian Journal of Pure \& Applied Mathematics
publication date: 2022-01-07T00:00:00Z
Mathematics Subject Classification ID: 90C32
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 7453758
zbMATH Keywords: fractional programming
zbMATH Keywords: sum-of-ratios problem
zbMATH Keywords: parametric convex programming approach
MaRDI profile type: Publication
full work available at URL: s13226-021-00102-y
OpenAlex ID: W3167274107
cites work: Nonlinear Programming
cites work: Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs
cites work: Solving sum of ratios fractional programs via concave minimization
cites work: Using concave envelopes to globally solve the nonlinear sum of ratios problem
cites work: Global optimization algorithm for the nonlinear sum of ratios problem
cites work: Sensitivity analysis for nonlinear programming using penalty methods
cites work: Solving the sum-of-ratios problem by an interior-point method
cites work: A global optimization algorithm for sum of quadratic ratios problem with coefficients
cites work: A branch and bound algorithm for globally solving a class of nonconvex programming problems
cites work: Global optimization algorithm for sum of generalized polynomial ratios problem
cites work: Practical global optimization for multiview geometry
cites work: Q3905599
cites work: A branch-and-bound algorithm for maximizing the sum of several linear ratios
cites work: Mesh shape-quality optimization using the inverse mean-ratio metric
cites work: An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints
cites work: Fractional programming: The sum-of-ratios case
cites work: Global optimization for the generalized polynomial sum of ratios problem
cites work: Using conical partition to globally maximizing the nonlinear sum of ratios
cites work: A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem
cites work: Global optimization for sum of linear ratios problem with coefficients
cites work: A branch and bound algorithm to globally solve the sum of several linear ratios
cites work: Global optimization for the sum of generalized polynomial fractional functions
cites work: Semidefinite relaxations of fractional programs via novel convexification techniques
cites work: Global optimization for sum of geometric fractional functions
cites work: Solving the sum-of-ratios problem by a stochastic search algorithm
cites work: Conical partition algorithm for maximizing the sum of dc ratios
DOI: 10.1007/S13226-021-00102-Y
description: scientific article; zbMATH DE number 7453758