Machine-inspired Enhancements of the Simplex Algorithm

Simple item page
dc.contributor.authorKalan, James E.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:36:06Zen
dc.date.available2013-06-19T14:36:06Zen
dc.date.issued1975en
dc.description.abstractUsing spare storage and over-lapping overhead available during the generation of the pricing form in the revised-simplex algorithm allows the production of additional reduced costs of variables which may be effectively used to avoid redundant pivots and to predict actual gains. Results from a simulation indicate a dramatic improvement over all other meaningful selection methods.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000786/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000786/01/CS75001-R.pdfen
dc.identifier.trnumberCS75001-Ren
dc.identifier.urihttp://hdl.handle.net/10919/20204en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleMachine-inspired Enhancements of the Simplex Algorithmen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
CS75001-R.pdf
Size:
487.15 KB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports