Fractional Programming with Homogeneous Functions

DOI10.1287/opre.22.2.350zbMath0282.90044OpenAlexW2169895536MaRDI QIDQ4768871

Sherwood C. Jun. Frey, Stephen P. Bradley

Publication date: 1974

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.22.2.350

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (15)

Inexact subgradient methods for quasi-convex optimization problems ⋮ Convergence of inexact quasisubgradient methods with extrapolation ⋮ The tolerance approach in multiobjective linear fractional programming ⋮ Location of a discrete resource and its allocation according to a fractional objective ⋮ Cost-effective allocations of bounded and binary resources in polynomial time ⋮ Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions ⋮ Convex-concave fractional programming with each variable occurring in a single constraint ⋮ Fixed point quasiconvex subgradient method ⋮ Allocation of resources according to a fractional objective ⋮ Sufficiency of Kuhn-Tucker optimality conditions for a fractional programming problem ⋮ Abstract convergence theorem for quasi-convex optimization problems with applications ⋮ Quasi-convex feasibility problems: subgradient methods and convergence rates ⋮ Incremental Quasi-Subgradient Method for Minimizing Sum of Geodesic Quasi-Convex Functions on Riemannian Manifolds with Applications ⋮ Bibliography in fractional programming ⋮ Experiments with linear fractional problems

This page was built for publication: Fractional Programming with Homogeneous Functions