Parametric Linear Programming and Anti-Cycling Pivoting Rules
The traditional perturbution (or lexicographic) methods for resolving degeneracy in linear programming impose decision rules that eliminate ties in the simplex ratio rule and, therefore,restrict the choice of exiting basic variables. Bland's combinatorial pivoting rule also restricts the choice...
Main Authors: | Magnanti, Thomas L., Orlin, James B., 1953- |
---|---|
Format: | Working Paper |
Language: | en_US |
Published: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
Online Access: | http://hdl.handle.net/1721.1/5332 |
Similar Items
-
Parametric linear programming and anti-cycling pivoting rules
Published: (2004) -
Parametric linear programming and anti-cycling pivoting rules
Published: (2003) -
Some Abstract Pivot Algorithms
by: Green, Curtis, et al.
Published: (2004) -
Some Abstract Pivot Algorithms (REVISED)
by: Green, Curtis, et al.
Published: (2004) -
A Linear Approximation Approach to Duality in Nonlinear Programming
by: Magnanti, Thomas L.
Published: (2004)