{"id":"https://openalex.org/W2124366113","doi":"https://doi.org/10.1002/9780470400531.eorms0395","title":"Implementing the Simplex Method","display_name":"Implementing the Simplex Method","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2124366113","doi":"https://doi.org/10.1002/9780470400531.eorms0395","mag":"2124366113"},"language":"en","primary_location":{"id":"doi:10.1002/9780470400531.eorms0395","doi":"https://doi.org/10.1002/9780470400531.eorms0395","is_oa":false,"landing_page_url":"https://doi.org/10.1002/9780470400531.eorms0395","pdf_url":null,"source":{"id":"https://openalex.org/S4306464293","display_name":"Wiley eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Wiley Encyclopedia of Operations Research and Management Science","raw_type":"other"},"volume":{"id":"https://openalex.org/W1481170590","display_name":"Wiley Encyclopedia of Operations Research and Management Science"},"type":"reference-entry","is_traditional":false,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066253278","display_name":"Matthew J. Saltzman","orcid":"https://orcid.org/0000-0003-1400-6529","observed_orcids":["https://orcid.org/0000-0003-1400-6529"]},"institutions":[{"id":"https://openalex.org/I8078737","display_name":"Clemson University","ror":"https://ror.org/037s24f05","country_code":"US","type":"education","lineage":["https://openalex.org/I8078737"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Matthew J. Saltzman","raw_affiliation_strings":["Clemson University, Department of Mathematical Sciences, Clemson, South Carolina"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Clemson University, Department of Mathematical Sciences, Clemson, South Carolina","institution_ids":["https://openalex.org/I8078737"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5066253278"],"corresponding_institution_ids":["https://openalex.org/I8078737"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9429000020027161,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9429000020027161,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.03840000182390213,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.009800000116229057,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/simplex-method","display_name":"simplex method","score":0.9639999866485596},{"id":"https://openalex.org/keywords/linear-programming","display_name":"linear programming","score":0.6690000295639038},{"id":"https://openalex.org/keywords/algorithm-implementation","display_name":"algorithm implementation","score":0.5329999923706055},{"id":"https://openalex.org/keywords/starting-solutions","display_name":"starting solutions","score":0.7639999985694885},{"id":"https://openalex.org/keywords/pricing","display_name":"pricing","score":0.7009999752044678},{"id":"https://openalex.org/keywords/ratio-test","display_name":"ratio test","score":0.9399999976158142},{"id":"https://openalex.org/keywords/sparse-linear-algebra","display_name":"sparse linear algebra","score":0.9520000219345093},{"id":"https://openalex.org/keywords/iteration-count-reduction","display_name":"iteration count reduction","score":0.5130000114440918}],"concepts":[{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.7690317630767822},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.7163066267967224},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.6820124387741089},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6575191020965576},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6512879133224487},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.6508268713951111},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.615081787109375},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5831440091133118},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.521005392074585},{"id":"https://openalex.org/C139352143","wikidata":"https://www.wikidata.org/wiki/Q82571","display_name":"Linear algebra","level":2,"score":0.47408854961395264},{"id":"https://openalex.org/C2777727622","wikidata":"https://www.wikidata.org/wiki/Q5251772","display_name":"Degeneracy (biology)","level":2,"score":0.474003404378891},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.43767470121383667},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.424100786447525},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.40110164880752563},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38998842239379883},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37943923473358154},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26995140314102173},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C60644358","wikidata":"https://www.wikidata.org/wiki/Q128570","display_name":"Bioinformatics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/9780470400531.eorms0395","doi":"https://doi.org/10.1002/9780470400531.eorms0395","is_oa":false,"landing_page_url":"https://doi.org/10.1002/9780470400531.eorms0395","pdf_url":null,"source":{"id":"https://openalex.org/S4306464293","display_name":"Wiley eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Wiley Encyclopedia of Operations Research and Management Science","raw_type":"other"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W177713027","https://openalex.org/W1533404702","https://openalex.org/W1559845238","https://openalex.org/W1586233612","https://openalex.org/W1593443060","https://openalex.org/W1971049631","https://openalex.org/W1977310057","https://openalex.org/W1978917746","https://openalex.org/W1979154120","https://openalex.org/W1988390398","https://openalex.org/W1991749916","https://openalex.org/W2003856348","https://openalex.org/W2004747092","https://openalex.org/W2011959190","https://openalex.org/W2013327579","https://openalex.org/W2027244403","https://openalex.org/W2027923483","https://openalex.org/W2051603784","https://openalex.org/W2052256717","https://openalex.org/W2053732480","https://openalex.org/W2071877138","https://openalex.org/W2087830284","https://openalex.org/W2088128439","https://openalex.org/W2091195410","https://openalex.org/W2107352296","https://openalex.org/W2111577575","https://openalex.org/W2139559439","https://openalex.org/W2611147814","https://openalex.org/W4248313157","https://openalex.org/W4254191750","https://openalex.org/W4300202611","https://openalex.org/W4301216918"],"related_works":["https://openalex.org/W1586233612","https://openalex.org/W4313384581","https://openalex.org/W136454111","https://openalex.org/W2494875324","https://openalex.org/W4249872099","https://openalex.org/W186649560","https://openalex.org/W2020093019","https://openalex.org/W2394102782","https://openalex.org/W7098024652","https://openalex.org/W148321778"],"abstract_inverted_index":{"Abstract":[0],"The":[1,73],"basic":[2],"simplex":[3,47,78],"method":[4],"is":[5],"a":[6,16,44,89],"simple":[7],"and":[8,23,62,71,75,83,96,99],"straightforward":[9],"algorithm,":[10],"but":[11],"modern":[12],"efficient":[13,46],"implementations":[14],"represent":[15],"tour":[17],"de":[18],"force":[19],"of":[20,56,60],"algorithm":[21],"engineering":[22],"numerical":[24],"methods":[25],"designed":[26],"to":[27,42],"exploit":[28],"opportunities":[29],"for":[30,87],"efficiency":[31],"wherever":[32],"they":[33],"arise.":[34],"This":[35],"article":[36],"surveys":[37],"the":[38,52,58,65],"key":[39],"techniques":[40,50,86],"necessary":[41],"implement":[43],"robust,":[45],"code.":[48],"These":[49],"support":[51],"strategic":[53],"design":[54],"principles":[55],"minimizing":[57],"number":[59],"iterations":[61],"carrying":[63],"out":[64],"computations":[66],"in":[67],"each":[68],"iteration":[69],"efficiently":[70],"accurately.":[72],"primal":[74],"dual":[76],"bounded\u2010variable":[77],"algorithms":[79],"are":[80,103],"described.":[81],"Efficient":[82],"robust":[84],"advanced":[85],"finding":[88],"starting":[90],"solution,":[91],"effective":[92],"pricing,":[93],"ratio":[94],"tests":[95],"degeneracy":[97],"management,":[98],"sparse":[100],"linear":[101],"algebra":[102],"covered.":[104]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2026-11-05T12:25:35.769452","created_date":"2016-06-24T00:00:00"}