{"id":"https://openalex.org/W2376526212","doi":null,"title":"A Global Optimal Algorithm for the Bilevel Linear Programming","display_name":"A Global Optimal Algorithm for the Bilevel Linear Programming","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2376526212","mag":"2376526212"},"language":"en","primary_location":{"id":"mag:2376526212","doi":null,"is_oa":false,"landing_page_url":"http://en.cnki.com.cn/Article_en/CJFDTOTAL-SDKY200901021.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2764440974","display_name":"Journal of Shandong University of Science and Technology","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4364297406","host_organization_name":"Shandong University of Science and Technology","host_organization_lineage":["https://openalex.org/P4364297406"],"host_organization_lineage_names":["Shandong University of Science and Technology"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Shandong University of Science and Technology","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/A5100696202","display_name":"Zhijiang Zhang","orcid":"https://orcid.org/0000-0002-3498-5333","observed_orcids":["https://orcid.org/0000-0002-3498-5333"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Zhijiang Zhang","raw_affiliation_strings":["College of Info Science and Eng"],"raw_orcid":"https://orcid.org/0000-0002-3498-5333","affiliations":[{"raw_affiliation_string":"College of Info Science and Eng","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5100696202"],"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.5038999915122986,"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.5038999915122986,"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.39500001072883606,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.04899999871850014,"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/bilevel-linear-programming","display_name":"bilevel linear programming","score":0.9929999709129333},{"id":"https://openalex.org/keywords/global-optimum","display_name":"global optimum","score":0.8489999771118164},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"cutting plane method","score":0.6890000104904175},{"id":"https://openalex.org/keywords/extreme-points","display_name":"extreme points","score":0.6610000133514404},{"id":"https://openalex.org/keywords/simplex-method","display_name":"simplex method","score":0.6759999990463257}],"concepts":[{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.759713351726532},{"id":"https://openalex.org/C3309286","wikidata":"https://www.wikidata.org/wiki/Q4907693","display_name":"Bilevel optimization","level":3,"score":0.7407699823379517},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.7239224910736084},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7190764546394348},{"id":"https://openalex.org/C39847760","wikidata":"https://www.wikidata.org/wiki/Q1385465","display_name":"Extreme point","level":2,"score":0.6914637684822083},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6672564744949341},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.5926985740661621},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.5639188289642334},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.5580844879150391},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47987428307533264},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.4763367772102356},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.47006210684776306},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.46326711773872375},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4480408728122711},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.44659700989723206},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4416581988334656},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.41380029916763306},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.2525683641433716},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.23289522528648376},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06753882765769958},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2376526212","doi":null,"is_oa":false,"landing_page_url":"http://en.cnki.com.cn/Article_en/CJFDTOTAL-SDKY200901021.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2764440974","display_name":"Journal of Shandong University of Science and Technology","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4364297406","host_organization_name":"Shandong University of Science and Technology","host_organization_lineage":["https://openalex.org/P4364297406"],"host_organization_lineage_names":["Shandong University of Science and Technology"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Shandong University of Science and Technology","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/W2379908400","https://openalex.org/W2392515202","https://openalex.org/W2371017651","https://openalex.org/W2371005282","https://openalex.org/W2350119391","https://openalex.org/W2363414825","https://openalex.org/W2389359953","https://openalex.org/W2367492128","https://openalex.org/W2032660889","https://openalex.org/W2350253686"],"abstract_inverted_index":{"Based":[0],"on":[1],"the":[2,10,27,38,43,47,58,73,82,88],"property":[3],"that":[4],"a":[5,32,53,68],"global":[6,69],"optimal":[7,70],"solution":[8,56,71],"for":[9,66],"bilevel":[11,48],"linear":[12,28,49],"programming":[13,50],"occurs":[14],"at":[15,57],"an":[16,64],"extreme":[17],"point":[18],"of":[19,26,46,87],"its":[20],"constraint":[21,35,44,60],"region":[22,45],"and":[23,51,84],"dual":[24],"theory":[25],"programming,the":[29],"paper,by":[30],"introducing":[31],"cutting":[33],"plane":[34],"corresponding":[36],"to":[37,80],"upper":[39],"objective":[40],"function,continuously":[41],"cuts":[42],"finds":[52],"better":[54],"feasible":[55],"novel":[59],"region,and":[61],"also":[62],"presents":[63],"algorithm":[65],"finding":[67],"with":[72],"simplex":[74],"method.The":[75],"numerical":[76],"example":[77],"is":[78],"used":[79],"illustrate":[81],"application":[83],"demonstrate":[85],"effectiveness":[86],"proposed":[89],"method.":[90]},"counts_by_year":[],"updated_date":"2026-10-01T08:54:57.152042","created_date":"2016-06-24T00:00:00"}