Duality theory for fractional programming problems under \(\eta\)- convexity (Q1101019)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4045504
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Duality theory for fractional programming problems under \(\eta\)- convexity |
scientific article; zbMATH DE number 4045504 |
Statements
Duality theory for fractional programming problems under \(\eta\)- convexity (English)
0 references
1987
0 references
We prove duality theorems for the second order dual problems similar to those formulated by \textit{V. Jeyakumar} [ibid. 22, 24-41 (1985; Zbl 0559.90087)] and the first order dual problem discussed by \textit{S. Schaible} [Manage. Sci. 22, 858-867 (1976; Zbl 0338.90050)], \textit{C. R. Bector} [Z. Oper. Res., Ser. A 17, 183-193 (1973; Zbl 0267.90086)], \textit{B. Mond} and \textit{T. Weir} [J. Inf. Optimization Sci. 3, 105-124 (1982; Zbl 0493.90082)], \textit{V. Jeyakumar} [loc. cit.] and \textit{T. Weir} [Opsearch 2, 241-247 (1985; Zbl 0577.90081)], under different forms of \(\eta\)-convexity.
0 references
duality theorems
0 references
second order dual problems
0 references
first order dual problem
0 references
\(\eta \)-convexity
0 references
0.8611047863960266
0 references
0.8547894954681396
0 references
0.8531121611595154
0 references
0.849577784538269
0 references
0.8413210511207581
0 references
