A computational comparison between algorithms for linear fractional programming (Q5286929)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A computational comparison between algorithms for linear fractional programming |
scientific article; zbMATH DE number 227542
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computational comparison between algorithms for linear fractional programming |
scientific article; zbMATH DE number 227542 |
Statements
A computational comparison between algorithms for linear fractional programming (English)
0 references
25 October 1993
0 references
computational experience
0 references
linear fractional problem
0 references
unbounded feasible region
0 references
comparison of the two algorithms
0 references
0.8403988480567932
0 references
0.8395596146583557
0 references
