A new look at fractional programming
From MaRDI portal
The parametric approach to fractional programming problems is examined and a new format is proposed for it. The latter reflects the fact that the approach as a whole capitalizes on a first-order necessary and sufficient optimality condition pertaining to differentiable pseudolinear functions.
Recommendations
Cites work
- A Review of Quasi-Convex Functions
- Fractional Programming. II, On Dinkelbach's Algorithm
- scientific article; zbMATH DE number 3562783 (Why is no real title available?)
- On Nonlinear Fractional Programming
- On Some Properties of Programming Problems in Parametric form Pertaining to Fractional Programming
- Pseudo-Concave Programming and Lagrange Regularity
- Seven Kinds of Convexity
- Solving Bicriterion Mathematical Programs
- The Direct Power of Adjacent Vertex Programming Methods
- The shortest path problem with two objective functions
Cited in
(6)- Solving special nonlinear fractional programming problems via parametric linear programming
- Fractional programming revisited
- Conical partition algorithm for maximizing the sum of dc ratios
- On quality concepts fractional programming
- A Fourth bibliography of fractional programming
- C-programming and the minimization of pseudolinear and additive concave functions
This page was built for publication: A new look at fractional programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1078093)