A solution comparison for dual angular linear programs (Q1088904)
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 4001867
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A solution comparison for dual angular linear programs |
scientific article; zbMATH DE number 4001867 |
Statements
A solution comparison for dual angular linear programs (English)
0 references
1987
0 references
Computational results are reported for Gass' Dualplex Method which is designed to solve dual structured linear programs. The test problem set includes a group of staircase problems from such diverse areas as economic development, agricultural planning, and cutting stock models. Each test problem is solved by an experimental dualplex code and an efficient commercial version of the simplex algorithm for comparative purposes. Based on the test problem results, the dualplex method is found to exhibit very good solution behavior and have steeper solution convergence than the commercial simplex code.
0 references
Computational results
0 references
Dualplex Method
0 references
dual structured linear programs
0 references
staircase problems
0 references
0.783843994140625
0 references
0.7716094255447388
0 references
0.7586421370506287
0 references
0.7559405565261841
0 references
