Duality in Multiple Right Hand Choice Linear Fractional Problems (Q3976925)
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 14411
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Duality in Multiple Right Hand Choice Linear Fractional Problems |
scientific article; zbMATH DE number 14411 |
Statements
Duality in Multiple Right Hand Choice Linear Fractional Problems (English)
0 references
25 June 1992
0 references
generalized linear fractional programming
0 references
strong duality theorems
0 references
0 references
0.8721665143966675
0 references
0.8687621355056763
0 references
0.8456125855445862
0 references
0.8410335779190063
0 references
0.8396731615066528
0 references
The authors suggest duals to a linear fractional programming problem as well as to a generalized linear fractional programming problem. The usual weak and strong duality theorems are established for a linear fractional programming problem with multiple right hand choice and its dual. These theorems are also established for the generalized linear fractional programming problem consisting of several fractional functions in which the objective is to minimize the largest fraction and its associated dual.
0 references
