{"id":"https://openalex.org/W2382682341","doi":null,"title":"The basic line algorithm for linear programming with bounded variables","display_name":"The basic line algorithm for linear programming with bounded variables","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2382682341","mag":"2382682341"},"language":"en","primary_location":{"id":"mag:2382682341","doi":null,"is_oa":false,"landing_page_url":"http://en.cnki.com.cn/Article_en/CJFDTOTAL-YCGL200601005.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2765047847","display_name":"Yunchou yu guanli","issn_l":"1007-3221","issn":["1007-3221"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4324113244","host_organization_name":"Operations Research Society of China","host_organization_lineage":["https://openalex.org/P4324113244"],"host_organization_lineage_names":["Operations Research Society of China"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Yunchou yu guanli","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/A5065711968","display_name":"Junmin Zhang","orcid":"https://orcid.org/0000-0003-4061-8350","observed_orcids":["https://orcid.org/0000-0003-4061-8350"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Junmin Zhang","raw_affiliation_strings":["Technology,Xi'an 710055,China)"],"raw_orcid":"https://orcid.org/0000-0003-4061-8350","affiliations":[{"raw_affiliation_string":"Technology,Xi'an 710055,China)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5065711968"],"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":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.7890999913215637,"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"}},"topics":[{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.7890999913215637,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.17399999499320984,"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.031300000846385956,"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/linear-programming","display_name":"linear programming","score":0.8859999775886536},{"id":"https://openalex.org/keywords/bounded-variables","display_name":"bounded variables","score":0.9900000095367432},{"id":"https://openalex.org/keywords/upper-bounds","display_name":"upper bounds","score":0.5600000023841858},{"id":"https://openalex.org/keywords/optimal-solution","display_name":"optimal solution","score":0.9110000133514404},{"id":"https://openalex.org/keywords/simplex-method-comparison","display_name":"simplex method comparison","score":0.8569999933242798},{"id":"https://openalex.org/keywords/number-of-iterations","display_name":"number of iterations","score":0.5350000262260437}],"concepts":[{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.8500853776931763},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7310932874679565},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6972206830978394},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5651677250862122},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5569540858268738},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.5240276455879211},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5043827295303345},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4993011951446533},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.4873086214065552},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47189080715179443},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4676235318183899},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.44750627875328064},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.43346428871154785},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.427446186542511},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.058646172285079956},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2382682341","doi":null,"is_oa":false,"landing_page_url":"http://en.cnki.com.cn/Article_en/CJFDTOTAL-YCGL200601005.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2765047847","display_name":"Yunchou yu guanli","issn_l":"1007-3221","issn":["1007-3221"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4324113244","host_organization_name":"Operations Research Society of China","host_organization_lineage":["https://openalex.org/P4324113244"],"host_organization_lineage_names":["Operations Research Society of China"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Yunchou yu guanli","raw_type":null}],"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/W2370077489","https://openalex.org/W2386941326","https://openalex.org/W2056544346","https://openalex.org/W2127269966","https://openalex.org/W2334053902","https://openalex.org/W2148639652","https://openalex.org/W1966613145","https://openalex.org/W2029443440","https://openalex.org/W2054288023","https://openalex.org/W263360274"],"abstract_inverted_index":{"This":[0],"paper":[1],"aims":[2],"to":[3,75,81],"study":[4],"the":[5,20,23,29,36,39,43,48,69,83],"algorithm":[6,16],"for":[7,54],"linear":[8],"programming":[9],"with":[10,68],"bounded":[11],"variables":[12],"and":[13,57,79],"a":[14],"new":[15],"is":[17,51],"obtained.Base":[18],"on":[19],"principles":[21],"of":[22,28,38],"basic":[24],"line":[25],"algorithm,aincreasing":[26],"sequence":[27],"objective":[30],"function":[31],"values":[32],"are":[33,60,72],"aquired":[34],"by":[35],"transforming":[37],"BL":[40],"table,and":[41],"consequently":[42],"hard":[44],"upper":[45],"bound":[46],"also":[47],"optimal":[49],"solution":[50],"obtained.The":[52],"procedures":[53],"this":[55],"method":[56,62],"an":[58],"example":[59],"given.The":[61],"provided":[63],"has":[64],"several":[65],"advantages":[66],"compared":[67],"simplex":[70],"method,that":[71],"more":[73],"simple,easer":[74],"operate,(fewer)":[76],"iteration":[77],"times":[78],"quicker":[80],"work":[82],"results":[84],"out.":[85]},"counts_by_year":[],"updated_date":"2025-10-10T17:16:08.811792","created_date":"2016-06-24T00:00:00"}