Parametric Linear Programming and Anti-Cycling Pivoting Rules

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5332

Full metadata record

DC Field	Value	Language
dc.creator	Magnanti, Thomas L.	-
dc.creator	Orlin, James B., 1953-	-
dc.date	2004-05-28T19:34:10Z	-
dc.date	2004-05-28T19:34:10Z	-
dc.date	1985-10	-
dc.date.accessioned	2013-10-09T02:39:05Z	-
dc.date.available	2013-10-09T02:39:05Z	-
dc.date.issued	2013-10-09	-
dc.identifier	http://hdl.handle.net/1721.1/5332	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	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 of exiting variables. Using ideas from parametric linear programming, we develop anti-cycling pivoting rules that do not limit the choice of exiting variables beyond the simplex ratio rule. That is, any variable that ties for the ratio rule can leave the basis. A similar approach gives pivoting rules for the dual simplex method that do not restrict the choice of entering variables.	-
dc.format	722045 bytes	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.publisher	Massachusetts Institute of Technology, Operations Research Center	-
dc.relation	Operations Research Center Working Paper;OR 144-85	-
dc.title	Parametric Linear Programming and Anti-Cycling Pivoting Rules	-
dc.type	Working Paper	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI