Fractional Programming with Homogeneous Functions
From MaRDI portal
Cited in
(20)- Location of a discrete resource and its allocation according to a fractional objective
- Cost-effective allocations of bounded and binary resources in polynomial time
- Allocation of resources according to a fractional objective
- The tolerance approach in multiobjective linear fractional programming
- Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
- Quasi-convex feasibility problems: subgradient methods and convergence rates
- Convergence of inexact quasisubgradient methods with extrapolation
- Fixed point quasiconvex subgradient method
- Inexact subgradient methods for quasi-convex optimization problems
- Bibliography in fractional programming
- Experiments with linear fractional problems
- Convex-concave fractional programming with each variable occurring in a single constraint
- Sufficiency of Kuhn-Tucker optimality conditions for a fractional programming problem
- Abstract convergence theorem for quasi-convex optimization problems with applications
- Incremental quasi-subgradient method for minimizing sum of geodesic quasi-convex functions on Riemannian manifolds with applications
- An algorithm for stochastic convex-concave fractional programs with applications to production efficiency and equitable resource allocation
- Convergence analysis of incremental quasi-subgradient method on Riemannian manifolds with lower bounded curvature
- A simultaneous quasi-subgradient method for minimizing convex function with quasi-convex functional constraints
- Subgradient splitting methods for nonsmooth fractional programming with fixed-point constraints
- A proximal algorithm for constrained multiobjective minimization with quasiconvex functions
This page was built for publication: Fractional Programming with Homogeneous Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4768871)
