{"id":"https://openalex.org/W2379908400","doi":null,"title":"A Global Optimization Algorithm for Solving Linear Bilevel Programming Based on the Cconcavity Cut","display_name":"A Global Optimization Algorithm for Solving Linear Bilevel Programming Based on the Cconcavity Cut","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2379908400","mag":"2379908400"},"language":"en","primary_location":{"id":"mag:2379908400","doi":null,"is_oa":false,"landing_page_url":"http://en.cnki.com.cn/Article_en/CJFDTOTAL-YCGL201201006.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/A5100609657","display_name":"Xiangrong Wang","orcid":"https://orcid.org/0000-0002-0209-1503","observed_orcids":["https://orcid.org/0000-0002-0209-1503"]},"institutions":[{"id":"https://openalex.org/I80143920","display_name":"Shandong University of Science and Technology","ror":"https://ror.org/04gtjhw98","country_code":"CN","type":"education","lineage":["https://openalex.org/I80143920"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xiangrong Wang","raw_affiliation_strings":["College of Information Science and Engineering , Shandong University of Science and Technology , Qingdao, 266510, China"],"raw_orcid":"https://orcid.org/0000-0002-0209-1503","affiliations":[{"raw_affiliation_string":"College of Information Science and Engineering , Shandong University of Science and Technology , Qingdao, 266510, China","institution_ids":["https://openalex.org/I80143920"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100609657"],"corresponding_institution_ids":["https://openalex.org/I80143920"],"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.6693999767303467,"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.6693999767303467,"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.15690000355243683,"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.1298000067472458,"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/bilevel-linear-programming","display_name":"bilevel linear programming","score":0.9990000128746033},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"cutting plane method","score":0.875},{"id":"https://openalex.org/keywords/global-optimization","display_name":"global optimization","score":0.9359999895095825},{"id":"https://openalex.org/keywords/duality-gap","display_name":"duality gap","score":0.9810000061988831},{"id":"https://openalex.org/keywords/lower-level-problem","display_name":"lower level problem","score":0.7950000166893005},{"id":"https://openalex.org/keywords/extreme-points","display_name":"extreme points","score":0.7179999947547913},{"id":"https://openalex.org/keywords/global-optimum","display_name":"global optimum","score":0.8309999704360962}],"concepts":[{"id":"https://openalex.org/C3309286","wikidata":"https://www.wikidata.org/wiki/Q4907693","display_name":"Bilevel optimization","level":3,"score":0.8948360681533813},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.7214634418487549},{"id":"https://openalex.org/C39847760","wikidata":"https://www.wikidata.org/wiki/Q1385465","display_name":"Extreme point","level":2,"score":0.6953368186950684},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6471577882766724},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.5725430250167847},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5569601655006409},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5489740967750549},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.49130526185035706},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.4770193099975586},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.4589989185333252},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4583733379840851},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.44485655426979065},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.444742351770401},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.44456925988197327},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.43086445331573486},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.41369062662124634},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.31470030546188354},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.23902201652526855},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10178020596504211},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","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},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2379908400","doi":null,"is_oa":false,"landing_page_url":"http://en.cnki.com.cn/Article_en/CJFDTOTAL-YCGL201201006.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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2376526212","https://openalex.org/W2371017651","https://openalex.org/W2363414825","https://openalex.org/W2389359953","https://openalex.org/W1605306376","https://openalex.org/W2350119391","https://openalex.org/W2067223240","https://openalex.org/W2782307095","https://openalex.org/W2371005282","https://openalex.org/W2392515202"],"abstract_inverted_index":{"A":[0],"concavity":[1,24],"cut":[2],"is":[3,34,66],"defined":[4],"by":[5],"discussing":[6],"the":[7,11,15,20,23,37,70,73],"duality":[8],"gap":[9],"of":[10,14,22,53,72],"lower":[12],"problem":[13],"linear":[16,31,45],"bilevel":[17,32,46],"programming.Based":[18],"on":[19,36],"feature":[21],"cut,a":[25],"cutting":[26],"plane":[27],"algorithm":[28,58],"for":[29],"solving":[30],"programming":[33,47],"given.Based":[35],"result":[38],"that":[39],"a":[40,61],"global":[41,62],"optimal":[42,63],"solution":[43],"to":[44,68],"occurs":[48],"at":[49],"an":[50],"extreme":[51],"point":[52],"its":[54],"constraint":[55],"region,the":[56],"proposed":[57],"can":[59],"obtain":[60],"solution.Finally,a":[64],"example":[65],"given":[67],"demonstrate":[69],"effectiveness":[71],"algorithm.":[74]},"counts_by_year":[],"updated_date":"2026-10-01T08:54:57.152042","created_date":"2016-06-24T00:00:00"}