{"id":"https://openalex.org/W2497521663","doi":"https://doi.org/10.1057/9781137573926_10","title":"The Artificial Variable Algorithm","display_name":"The Artificial Variable Algorithm","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2497521663","doi":"https://doi.org/10.1057/9781137573926_10","mag":"2497521663"},"language":"en","primary_location":{"id":"doi:10.1057/9781137573926_10","doi":"https://doi.org/10.1057/9781137573926_10","is_oa":false,"landing_page_url":"https://doi.org/10.1057/9781137573926_10","pdf_url":null,"source":{"id":"https://openalex.org/S4306463717","display_name":"Palgrave Macmillan US eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"An Economic Interpretation of Linear Programming","raw_type":"book-chapter"},"volume":{"id":"https://openalex.org/W1526449947","display_name":"An Economic Interpretation of Linear Programming"},"type":"book-chapter","is_traditional":true,"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/A5112713031","display_name":"Quirino Paris","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Quirino Paris","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5112713031"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"219","last_page":"234"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.5464000105857849,"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.5464000105857849,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.3840000033378601,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.061500001698732376,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/simplex-method","display_name":"simplex method","score":0.5809999704360962},{"id":"https://openalex.org/keywords/primal-simplex-algorithm","display_name":"primal simplex algorithm","score":0.8479999899864197},{"id":"https://openalex.org/keywords/dual-simplex-algorithm","display_name":"dual simplex algorithm","score":1.0},{"id":"https://openalex.org/keywords/linear-programming","display_name":"linear programming","score":0.8360000252723694},{"id":"https://openalex.org/keywords/basic-feasible-solution","display_name":"basic feasible solution","score":0.7540000081062317},{"id":"https://openalex.org/keywords/inequality-constraints","display_name":"inequality constraints","score":0.46000000834465027},{"id":"https://openalex.org/keywords/initial-basic-feasible-solution","display_name":"initial basic feasible solution","score":0.5389999747276306}],"concepts":[{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.671434760093689},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.6592614054679871},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6473851203918457},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6246193647384644},{"id":"https://openalex.org/C191157680","wikidata":"https://www.wikidata.org/wiki/Q17085895","display_name":"Revised simplex method","level":4,"score":0.6030813455581665},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6022895574569702},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4289765954017639},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.41451483964920044},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.41267716884613037},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36218810081481934},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26460641622543335},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.20782560110092163},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07926082611083984},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1057/9781137573926_10","doi":"https://doi.org/10.1057/9781137573926_10","is_oa":false,"landing_page_url":"https://doi.org/10.1057/9781137573926_10","pdf_url":null,"source":{"id":"https://openalex.org/S4306463717","display_name":"Palgrave Macmillan US eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"An Economic Interpretation of Linear Programming","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2071366087","https://openalex.org/W2041349426","https://openalex.org/W7214659332","https://openalex.org/W7098982466","https://openalex.org/W2501663678","https://openalex.org/W2024526815","https://openalex.org/W2388936829","https://openalex.org/W4236044635","https://openalex.org/W2389404837","https://openalex.org/W2056278119"],"abstract_inverted_index":{"With":[0],"knowledge":[1],"of":[2,19,59,70,137,150,157,206],"the":[3,7,57,60,66,71,76,104,120,125,138,148,155,180,188,219,231,238,244],"primal":[4,38,83,105,121,170,181],"simplex":[5,9,106,140,152,212],"and":[6,34,118,228,237],"dual":[8,126,139,184,189],"algorithms,":[10],"it":[11],"is":[12,53,143,191,235],"possible":[13],"to":[14,49,54,75,145,163,218],"solve":[15],"two":[16],"large":[17],"classes":[18],"linear":[20],"programming":[21],"problems.":[22],"The":[23,108],"first":[24],"class":[25,110],"contains":[26,111],"those":[27,112],"problems":[28,52,113,130],"whose":[29,114],"constraints":[30,115],"are":[31,116,209],"all":[32,179,194],"inequalities":[33,117],"admit":[35],"an":[36,135,158],"easy":[37],"feasible":[39,77,85,161],"basis":[40],"(the":[41,62],"identity":[42],"matrix":[43],"I":[44],").":[45,203],"An":[46],"equivalent":[47],"way":[48],"regard":[50],"these":[51,207],"say":[55],"that":[56,147,169,177,187],"origin":[58],"space":[61],"zero":[63],"point":[64],"in":[65,193],"Cartesian":[67],"coordinate":[68],"system":[69],"output":[72],"space)":[73],"belongs":[74],"region.":[78],"For":[79],"such":[80],"problems,":[81],"a":[82,173],"basic":[84,160],"solution":[86,100,162,190],"can":[87,96,131,214],"be":[88,132,215,241],"established":[89],"simply":[90],"by":[91,101,134,226,230],"inspection":[92],"and,":[93],"therefore,":[94],"we":[95],"find":[97],"their":[98],"optimal":[99],"immediately":[102],"applying":[103],"algorithm.":[107,141],"second":[109],"satisfy":[119],"optimality":[122],"criterion":[123],"(equivalently,":[124],"feasibility":[127,171,185],"criterion).":[128],"These":[129,222],"solved":[133],"application":[136],"It":[142],"important":[144],"notice":[146],"use":[149],"either":[151,164],"algorithm":[153,213,246],"requires":[154],"availability":[156],"explicit":[159],"problem.":[165,221],"Let":[166],"us":[167],"recall":[168],"means":[172,186],"nonnegative":[174,192],"vector":[175],"x":[176],"satisfies":[178],"constraints.":[182],"Analogously,":[183],"its":[195],"components":[196],"(":[197],"z":[198],"j":[199,202],"\u2212":[200],"c":[201],"If":[204],"neither":[205,211],"conditions":[208],"satisfied,":[210],"applied":[216],"directly":[217],"LP":[220],"keywords":[223,239],"were":[224],"added":[225],"machine":[227],"not":[229],"authors.":[232],"This":[233],"process":[234],"experimental":[236],"may":[240],"updated":[242],"as":[243],"learning":[245],"improves.":[247]},"counts_by_year":[],"updated_date":"2026-10-10T09:11:00.788812","created_date":"2016-08-23T00:00:00"}