Partially normalized pivot selection in linear programming
An algorithm is presented for pivot selection in the simplex method using the partial norm of the updated column to dynamically scale the reduced costs. The geometry of this partial norm method is compared with several known methods including the usual simplex pivot selection rule and Harris’ Devex...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buchkapitel |
Sprache: | eng |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Schreiben Sie den ersten Kommentar!