{"id":"https://openalex.org/W2579233161","doi":"https://doi.org/10.1007/978-1-4039-3769-8_2","title":"Linear Programming: an introduction","display_name":"Linear Programming: an introduction","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2579233161","doi":"https://doi.org/10.1007/978-1-4039-3769-8_2","mag":"2579233161"},"language":"en","primary_location":{"id":"doi:10.1007/978-1-4039-3769-8_2","doi":"https://doi.org/10.1007/978-1-4039-3769-8_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-1-4039-3769-8_2","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Linear Programming/Critical Path Analysis","raw_type":"book-chapter"},"volume":{"id":"https://openalex.org/W654359191","display_name":"Linear Programming/Critical Path Analysis"},"type":"book-chapter","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/A5077289298","display_name":"Mik Wisniewski","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mik Wisniewski","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5024783318","display_name":"Jonathan H. Klein","orcid":"https://orcid.org/0000-0002-5495-8738","observed_orcids":["https://orcid.org/0000-0002-5495-8738"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jonathan H. Klein","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"7","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9945999979972839,"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.9945999979972839,"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.0034000000450760126,"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/T13706","display_name":"Management and Optimization Techniques","score":0.0010999999940395355,"subfield":{"id":"https://openalex.org/subfields/1408","display_name":"Strategy and Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"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.9990000128746033},{"id":"https://openalex.org/keywords/graphical-method","display_name":"graphical method","score":0.9860000014305115},{"id":"https://openalex.org/keywords/objective-function","display_name":"objective function","score":0.9279999732971191},{"id":"https://openalex.org/keywords/constraints","display_name":"constraints","score":0.953000009059906},{"id":"https://openalex.org/keywords/optimal-solution","display_name":"optimal solution","score":0.8399999737739563},{"id":"https://openalex.org/keywords/business-optimization","display_name":"business optimization","score":0.4309999942779541}],"concepts":[{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.7772244215011597},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.6200342178344727},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5983300805091858},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5643646121025085},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5260669589042664},{"id":"https://openalex.org/C60033838","wikidata":"https://www.wikidata.org/wiki/Q1751685","display_name":"Solution set","level":3,"score":0.44781872630119324},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.4475812613964081},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4347207248210907},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3758693337440491},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3528718054294586},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1223578155040741},{"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.1007/978-1-4039-3769-8_2","doi":"https://doi.org/10.1007/978-1-4039-3769-8_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-1-4039-3769-8_2","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Linear Programming/Critical Path Analysis","raw_type":"book-chapter"}],"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/W1034879728","https://openalex.org/W2573490216","https://openalex.org/W4237273836","https://openalex.org/W3156040042","https://openalex.org/W3205027367","https://openalex.org/W4285254219","https://openalex.org/W6941186809","https://openalex.org/W2487875967","https://openalex.org/W4311365871","https://openalex.org/W7098500542"],"abstract_inverted_index":{"In":[0],"this":[1,74],"chapter":[2],"we":[3,41,71,124,139,181],"introduce":[4,182],"the":[5,12,55,67,101,108,112,131,166,169,197,204,210],"basic":[6],"linear":[7],"programming":[8],"model":[9],"and":[10,58,171,194,203],"develop":[11],"graphical":[13],"method":[14,150],"as":[15,154,160,209],"a":[16,48,61,79,98,141,183],"means":[17],"of":[18,63,78,114,165,168],"finding":[19],"an":[20,24,83,88,115,155,163,176],"optimal":[21],"solution":[22,113,132,144,159,173,186],"to":[23,43,129,157],"LP":[25,29,84,116,158],"problem.":[26,110],"Typically,":[27],"all":[28],"problems":[30],"have":[31],"two":[32],"common":[33],"features:":[34],"they":[35,59],"involve":[36,60],"some":[37],"declared":[38],"objective":[39],"which":[40,65,70],"seek":[42],"optimize":[44],"(looking":[45],"for":[46,133],"either":[47],"maximum":[49],"or":[50],"minimum":[51],"value":[52],"depending":[53],"on":[54,147],"exact":[56],"problem)":[57],"set":[62],"constraints":[64],"limit":[66],"way":[68],"in":[69,91],"can":[72],"attain":[73],"objective.":[75],"The":[76],"formulation":[77],"business":[80,109],"problem":[81,117],"into":[82],"format":[85],"is":[86,120,151,178,201],"almost":[87],"art":[89],"form":[90],"its":[92,172],"own":[93],"sake":[94],"requiring":[95],"not":[96,195],"only":[97],"familiarity":[99,106],"with":[100,107],"technique":[102,170],"itself":[103],"but":[104],"also":[105],"Fortunately,":[111],"once":[118],"formulated":[119],"much":[121],"more":[122,142,184],"straightforward:":[123],"use":[125],"appropriate":[126],"computer":[127],"software":[128],"find":[130],"us.":[134],"To":[135],"begin":[136],"with,":[137],"however,":[138],"examine":[140],"mundane":[143],"process":[145,200],"based":[146],"graphs.":[148],"This":[149,199],"particularly":[152],"useful":[153],"introduction":[156],"it":[161],"facilitates":[162],"understanding":[164,177],"concepts":[167],"algorithm.":[174],"Such":[175],"essential":[179],"before":[180],"complex":[185],"method.":[187],"These":[188],"keywords":[189,205],"were":[190],"added":[191],"by":[192,196],"machine":[193],"authors.":[198],"experimental":[202],"may":[206],"be":[207],"updated":[208],"learning":[211],"algorithm":[212],"improves.":[213]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2017-01-26T00:00:00"}