Digitale Medien
Springer
Journal of optimization theory and applications
45 (1985), S. 113-122
ISSN:
1573-2878
Schlagwort(e):
Generalized upper bounds
;
dual simplex method
;
algorithms
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Mathematik
Notizen:
Abstract The dual simplex method for generalized upper bound (GUB) problems is presented. One of the major operations in the dual simplex method is to update the elements of therth row, wherer is the index for the leaving basic variable. Those updated elements are used for the ratio test to determine the entering basic variabble. A very simple formula for therth row update for the dual simplex method for a GUB problem is derived, which is similar to the formula for the standard linear program. This derivation is based on the change key operation, which is to exchange the key column and its counterpart in the nonkey section. The change key operation is possible because of a theorem that guarantees the existence of such a counterpart.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1007/BF00940817
Permalink
| Bibliothek |
Standort |
Signatur |
Band/Heft/Jahr |
Verfügbarkeit |
