{"id":"https://openalex.org/W2388936829","doi":null,"title":"A Primai-dual Simplex Algorithm for Linear Programming","display_name":"A Primai-dual Simplex Algorithm for Linear Programming","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2388936829","mag":"2388936829"},"language":"en","primary_location":{"id":"mag:2388936829","doi":null,"is_oa":false,"landing_page_url":"http://en.cnki.com.cn/Article_en/CJFDTOTAL-ZJJG201303004.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2764763652","display_name":"Journal of Jiaxing University","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4365328776","host_organization_name":"Jiaxing University","host_organization_lineage":["https://openalex.org/P4365328776"],"host_organization_lineage_names":["Jiaxing University"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Jiaxing University","raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5056500556","display_name":"Gao Pei-wang","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I354108","display_name":"Minjiang University","ror":"https://ror.org/00s7tkw17","country_code":"CN","type":"education","lineage":["https://openalex.org/I354108"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Gao Pei-wang","raw_affiliation_strings":["Department of Mathematics,Minjiang University,Fuzhou,Fujian,Fujian350108)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics,Minjiang University,Fuzhou,Fujian,Fujian350108)","institution_ids":["https://openalex.org/I354108"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5056500556"],"corresponding_institution_ids":["https://openalex.org/I354108"],"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":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.7910000085830688,"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.7910000085830688,"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.10429999977350235,"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.09529999643564224,"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/linear-programming","display_name":"linear programming","score":0.9800000190734863},{"id":"https://openalex.org/keywords/dual-simplex-algorithm","display_name":"dual simplex algorithm","score":0.5680000185966492},{"id":"https://openalex.org/keywords/computational-performance","display_name":"computational performance","score":0.7300000190734863}],"concepts":[{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.8912537693977356},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.7785853743553162},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.7637882232666016},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.7556449174880981},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6321429014205933},{"id":"https://openalex.org/C191157680","wikidata":"https://www.wikidata.org/wiki/Q17085895","display_name":"Revised simplex method","level":4,"score":0.6106053590774536},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5505964756011963},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.530998706817627},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5098575949668884},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.4925435483455658},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.4478137791156769},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4437016546726227},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41101759672164917},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40662747621536255},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11012834310531616},{"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/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}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2388936829","doi":null,"is_oa":false,"landing_page_url":"http://en.cnki.com.cn/Article_en/CJFDTOTAL-ZJJG201303004.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2764763652","display_name":"Journal of Jiaxing University","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4365328776","host_organization_name":"Jiaxing University","host_organization_lineage":["https://openalex.org/P4365328776"],"host_organization_lineage_names":["Jiaxing University"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Jiaxing University","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7214659332","https://openalex.org/W4239921472","https://openalex.org/W2016833203","https://openalex.org/W2086346232","https://openalex.org/W2161168459","https://openalex.org/W2497521663","https://openalex.org/W1965005420","https://openalex.org/W2736613941","https://openalex.org/W2056278119","https://openalex.org/W3196270387"],"abstract_inverted_index":{"Starting":[0],"from":[1],"an":[2],"initial":[3],"basis":[4],"with":[5,32],"the":[6,27,33,37,52,55,63,70,79,89,92,96,107,110,114,128,136,158],"primal":[7,20],"and":[8,149],"dual":[9,100],"infeasibility,this":[10],"paper":[11],"presents":[12],"a":[13,48],"primal-dual":[14],"simplex":[15,21,56,101,138,160],"algorithm":[16,22,102,133,145],"for":[17],"linear":[18,29],"programming.First,the":[19],"is":[23,47,103,118,124],"applied":[24,104],"to":[25,42,51,68,105,109,126,135],"solve":[26],"associated":[28],"programming":[30],"problem":[31,112],"negative":[34,60],"entries":[35,61],"of":[36,62,91,95,131],"right-hand":[38,64],"side":[39,65],"set":[40],"equal":[41],"zero.If":[43],"any,the":[44],"optimal":[45,93],"solution":[46,84,94,108],"regular":[49,83],"one":[50],"original":[53,74,97,111],"problem.In":[54],"iterative":[57,81],"process,once":[58],"some":[59],"are":[66,76],"transformed":[67],"take":[69],"nonnegative":[71],"value,the":[72],"corresponding":[73],"constraints":[75],"restored":[77],"in":[78],"subsequent":[80],"computation.So,the":[82],"obtained":[85],"can":[86],"be":[87],"on":[88,154],"neighboring":[90],"problem(if":[98],"any).Next,the":[99],"find":[106],"or":[113],"conclusion":[115],"that":[116,143],"there":[117],"no":[119],"feasible":[120],"solution.Finally,a":[121],"computer":[122],"implementation":[123],"accomplished":[125],"test":[127],"computational":[129,140],"performance":[130],"our":[132,144],"comparing":[134],"classical":[137,159],"algorithm.The":[139],"results":[141],"show":[142],"uses":[146],"fewer":[147],"iterations":[148],"spends":[150],"less":[151],"executive":[152],"time":[153],"most":[155],"instances":[156],"than":[157],"algorithm.":[161]},"counts_by_year":[],"updated_date":"2025-10-10T17:16:08.811792","created_date":"2016-06-24T00:00:00"}