In mathematical optimization, the revised simplex method is a variant of George Dantzig's simplex method for linear programming. The revised simplex method is mathematically equivalent to the standard simplex method but differs in implementation. Instead of maintaining a tableau which explicitly represents the constraints adjusted to a set of basic variables, it maintains a representation of a basis of the matrix representing the constraints. The matrixoriented approach allows for greater computational efficiency by enabling sparse matrix operations.
Property  Value 

dbo:abstract 

dbo:wikiPageExternalLink  
dbo:wikiPageID 

dbo:wikiPageRevisionID 

dct:subject  
http://purl.org/linguistics/gold/hypernym  
rdf:type 

rdfs:comment 

rdfs:label 

rdfs:seeAlso  
owl:sameAs  
prov:wasDerivedFrom  
foaf:isPrimaryTopicOf  
is dbo:wikiPageRedirects of  
is foaf:primaryTopic of 