A note on duality for fractional programming problems (Q1065720)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on duality for fractional programming problems |
scientific article |
Statements
A note on duality for fractional programming problems (English)
0 references
1985
0 references
Consider the fractional programming problem: minimize f(x)/g(x) subject to h(x)\(\leq 0\) where \(g(x)>0\) for all feasible x. Many duals to this problem can be found in the literature under a variety of convexity conditions. Here the author gives different duals that allow further weakening of the convexity requirements. Dual theorems are also given that make use of strong and weak generalized convex functions.
0 references
Dual theorems
0 references
strong and weak generalized convex functions
0 references