{"id":"https://openalex.org/W2148639652","doi":"https://doi.org/10.1080/00207390600594879","title":"A partitioning and bounded variable algorithm for linear programming","display_name":"A partitioning and bounded variable algorithm for linear programming","publication_year":2006,"publication_date":"2006-06-15","ids":{"openalex":"https://openalex.org/W2148639652","doi":"https://doi.org/10.1080/00207390600594879","mag":"2148639652"},"language":"en","primary_location":{"id":"doi:10.1080/00207390600594879","doi":"https://doi.org/10.1080/00207390600594879","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207390600594879","pdf_url":null,"source":{"id":"https://openalex.org/S131125421","display_name":"International Journal of Mathematical Education in Science and Technology","issn_l":"0020-739X","issn":["0020-739X","1464-5211"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","erih-plus","jufo-1","norway-1","poland-40","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Mathematical Education in Science and Technology","raw_type":"journal-article"},"volume":null,"type":"article","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/A5091198258","display_name":"Theodore J. Sheskin","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I102607778","display_name":"Cleveland State University","ror":"https://ror.org/002tx1f22","country_code":"US","type":"education","lineage":["https://openalex.org/I102607778"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Theodore J. Sheskin","raw_affiliation_strings":["Industrial Engineering Department, Cleveland State University, 2121 Euclid Avenue, Cleveland, OH 44115-2214, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Industrial Engineering Department, Cleveland State University, 2121 Euclid Avenue, Cleveland, OH 44115-2214, USA","institution_ids":["https://openalex.org/I102607778"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5091198258"],"corresponding_institution_ids":["https://openalex.org/I102607778"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":"37","issue":"4","first_page":"433","last_page":"442"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.7050999999046326,"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.7050999999046326,"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.26030001044273376,"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.026499999687075615,"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.7799999713897705},{"id":"https://openalex.org/keywords/simplex-method","display_name":"simplex method","score":0.8050000071525574},{"id":"https://openalex.org/keywords/variable-elimination","display_name":"variable elimination","score":0.5270000100135803},{"id":"https://openalex.org/keywords/artificial-variables","display_name":"artificial variables","score":0.5049999952316284},{"id":"https://openalex.org/keywords/two-stage-approach","display_name":"two-stage approach","score":0.8220000267028809},{"id":"https://openalex.org/keywords/big-m-method","display_name":"big-M method","score":0.9110000133514404},{"id":"https://openalex.org/keywords/modified-simplex-method","display_name":"modified simplex method","score":0.45100000500679016}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6321970224380493},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5925205945968628},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.5740401148796082},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.513603687286377},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.48318758606910706},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46620237827301025},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44941458106040955},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3504001200199127},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.3326168954372406},{"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.1080/00207390600594879","doi":"https://doi.org/10.1080/00207390600594879","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207390600594879","pdf_url":null,"source":{"id":"https://openalex.org/S131125421","display_name":"International Journal of Mathematical Education in Science and Technology","issn_l":"0020-739X","issn":["0020-739X","1464-5211"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","erih-plus","jufo-1","norway-1","poland-40","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Mathematical Education in Science and Technology","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1533822380","https://openalex.org/W1585591997","https://openalex.org/W1968902264","https://openalex.org/W2005705954","https://openalex.org/W2006584901","https://openalex.org/W2010997912","https://openalex.org/W2028547116","https://openalex.org/W2031977408","https://openalex.org/W2920966226","https://openalex.org/W3142379583","https://openalex.org/W4205508831"],"related_works":["https://openalex.org/W2370077489","https://openalex.org/W2051310844","https://openalex.org/W2382682341","https://openalex.org/W2127269966","https://openalex.org/W2386941326","https://openalex.org/W2056544346","https://openalex.org/W1588383772","https://openalex.org/W2736798367","https://openalex.org/W1966613145","https://openalex.org/W2999302164"],"abstract_inverted_index":{"An":[0],"interesting":[1],"new":[2],"partitioning":[3],"and":[4,49,157,183],"bounded":[5,41,141],"variable":[6],"algorithm":[7,24],"(PBVA)":[8],"is":[9,18,68,90,103,132,169],"proposed":[10],"for":[11,40,140],"solving":[12],"linear":[13,66,193],"programming":[14,194],"problems.":[15],"The":[16,110,167],"PBVA":[17,55,156,168],"a":[19,27,64],"variant":[20],"of":[21,30,113,123,161,192,202],"the":[22,31,36,46,50,54,62,94,114,120,124,136,144,155,162,200,203],"simplex":[23,32,38,95,138,163],"which":[25,131],"uses":[26],"modified":[28,97],"form":[29,127],"method":[33,39,48,96,139,164],"followed":[34],"by":[35,70,92,134,151],"dual":[37,137],"variables.":[42,60,142],"In":[43,61,187],"contrast":[44],"to":[45,119,126,171,198],"two-phase":[47],"big":[51],"M":[52],"method,":[53],"does":[56],"not":[57],"introduce":[58],"artificial":[59],"PBVA,":[63],"reduced":[65,115],"program":[67],"formed":[69],"eliminating":[71],"as":[72,75],"many":[73],"variables":[74,145],"there":[76],"are":[77,117,149,165,196],"equality":[78,181],"constraints.":[79,186],"A":[80],"subproblem":[81,125],"containing":[82],"one":[83],"\u2018less":[84],"than":[85],"or":[86],"equal":[87],"to\u2019":[88],"constraint":[89],"solved":[91,133,197],"executing":[93],"such":[98],"that":[99,146],"an":[100,106,128,173],"upper":[101],"bound":[102],"placed":[104],"on":[105],"unbounded":[107],"entering":[108],"variable.":[109],"remaining":[111],"constraints":[112],"problem":[116,175],"added":[118],"optimal":[121],"tableau":[122],"augmented":[129],"tableau,":[130],"applying":[135],"Lastly,":[143],"were":[147],"eliminated":[148],"restored":[150],"substitution.":[152],"Differences":[153],"between":[154],"two":[158,180,184],"other":[159,190],"variants":[160],"identified.":[166],"applied":[170],"solve":[172],"example":[174],"with":[176],"five":[177],"decision":[178],"variables,":[179],"constraints,":[182],"inequality":[185],"addition,":[188],"three":[189],"types":[191],"problems":[195],"justify":[199],"advantages":[201],"PBVA.":[204]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-08-15T07:11:24.734988","created_date":"2016-06-24T00:00:00"}