{"id":"https://openalex.org/W2517438673","doi":null,"title":"The Simplex Method for Dynamic Linear Programs","display_name":"The Simplex Method for Dynamic Linear Programs","publication_year":1978,"publication_date":"1978-09-01","ids":{"openalex":"https://openalex.org/W2517438673","mag":"2517438673"},"language":"en","primary_location":{"id":"pmh:oai:pure.iiasa.ac.at:829","doi":null,"is_oa":true,"landing_page_url":"http://pure.iiasa.ac.at/id/eprint/829/1/RR-78-014.pdf","pdf_url":"http://pure.iiasa.ac.at/id/eprint/829/1/RR-78-014.pdf","source":{"id":"https://openalex.org/S4306401423","display_name":"IIASA PURE (International Institute of Applied Systems Analysis)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1317774081","host_organization_name":"International Institute for Applied Systems Analysis","host_organization_lineage":["https://openalex.org/I1317774081"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Monograph"},"volume":null,"type":"book","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://pure.iiasa.ac.at/id/eprint/829/1/RR-78-014.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083030619","display_name":"A.I. Propoi","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A.I. Propoi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5057947132","display_name":"\u041a\u0440\u0438\u0432\u043e\u043d\u043e\u0436\u043a\u043e \u0412\u043b\u0430\u0434\u0438\u043c\u0438\u0440 \u0415\u0433\u043e\u0440\u043e\u0432\u0438\u0447","orcid":"https://orcid.org/0000-0003-0583-2829","observed_orcids":["https://orcid.org/0000-0003-0583-2829"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"V. E. Krivonozhko","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-0583-2829","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7394,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.76153846,"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.6435999870300293,"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.6435999870300293,"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.2401999980211258,"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.07760000228881836,"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/dynamic-linear-programming","display_name":"dynamic linear programming","score":0.9710000157356262},{"id":"https://openalex.org/keywords/duality-relations","display_name":"duality relations","score":0.8330000042915344},{"id":"https://openalex.org/keywords/transportation-problem","display_name":"transportation problem","score":0.5049999952316284},{"id":"https://openalex.org/keywords/control-theory","display_name":"control theory","score":0.6549999713897705}],"concepts":[{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.8263723254203796},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.732591450214386},{"id":"https://openalex.org/C191157680","wikidata":"https://www.wikidata.org/wiki/Q17085895","display_name":"Revised simplex method","level":4,"score":0.6840574741363525},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.5579163432121277},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.511216402053833},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5007345676422119},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.49513664841651917},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.4893912374973297},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.46215206384658813},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4617159366607666},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.44737234711647034},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.4118480682373047},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38162437081336975},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35399526357650757},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.1300431191921234},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:pure.iiasa.ac.at:829","doi":null,"is_oa":true,"landing_page_url":"http://pure.iiasa.ac.at/id/eprint/829/1/RR-78-014.pdf","pdf_url":"http://pure.iiasa.ac.at/id/eprint/829/1/RR-78-014.pdf","source":{"id":"https://openalex.org/S4306401423","display_name":"IIASA PURE (International Institute of Applied Systems Analysis)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1317774081","host_organization_name":"International Institute for Applied Systems Analysis","host_organization_lineage":["https://openalex.org/I1317774081"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Monograph"},{"id":"mag:2517438673","doi":null,"is_oa":false,"landing_page_url":"http://pure.iiasa.ac.at/id/eprint/829/","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:pure.iiasa.ac.at:829","doi":null,"is_oa":true,"landing_page_url":"http://pure.iiasa.ac.at/id/eprint/829/1/RR-78-014.pdf","pdf_url":"http://pure.iiasa.ac.at/id/eprint/829/1/RR-78-014.pdf","source":{"id":"https://openalex.org/S4306401423","display_name":"IIASA PURE (International Institute of Applied Systems Analysis)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1317774081","host_organization_name":"International Institute for Applied Systems Analysis","host_organization_lineage":["https://openalex.org/I1317774081"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Monograph"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2517438673.pdf","grobid_xml":"https://content.openalex.org/works/W2517438673.grobid-xml"},"referenced_works_count":7,"referenced_works":["https://openalex.org/W1500775699","https://openalex.org/W1976025854","https://openalex.org/W2128978199","https://openalex.org/W2153272153","https://openalex.org/W2160096337","https://openalex.org/W2526626480","https://openalex.org/W2752270121"],"related_works":["https://openalex.org/W2526626480","https://openalex.org/W78276666","https://openalex.org/W2342922979","https://openalex.org/W2725474149","https://openalex.org/W2387612670","https://openalex.org/W2153096538","https://openalex.org/W1983836100","https://openalex.org/W2013731460","https://openalex.org/W2901179622","https://openalex.org/W2545820317"],"abstract_inverted_index":{"This":[0],"paper":[1,20,148],"presents":[2],"an":[3],"extension":[4],"of":[5,14,22,29,34,54,68,152,160,171,178,184,190,199],"the":[6,9,35,49,52,55,69,74,77,104,146,161,169,172,185,200],"simplex":[7,44,106],"method,":[8],"basic":[10],"method":[11,173],"for":[12,92,155],"solution":[13],"dynamic":[15,43,105],"linear":[16,126,192],"programming":[17,193],"problems.":[18],"The":[19,157],"consists":[21],"three":[23],"parts.":[24],"Part":[25,40,58,81,108,121],"I,":[26],"\"dual":[27],"systems":[28],"DLP\",":[30],"concerns":[31],"theoretical":[32],"properties":[33],"problem,":[36],"primarily,":[37],"duality":[38],"relations;":[39],"II,":[41],"\"the":[42],"method:":[45],"general":[46,94],"approach\"":[47],"describes":[48],"idea":[50],"and":[51,57,139,174,181],"theory":[53,119,151],"method;":[56],"III,":[59],"\"a":[60],"basis":[61,78],"factorization":[62,79],"approach\",":[63],"gives":[64],"a":[65,85,93,113,150,176],"complete":[66],"description":[67],"algorithm,":[70],"as":[71,73,132],"well":[72],"connection":[75],"with":[76,135],"approach.":[80],"III":[82,122],"also":[83],"includes":[84],"numerical":[86,166],"example":[87],"that":[88],"is":[89,98,110,123],"not":[90],"trivial":[91],"LP":[95],"algorithm":[96],"but":[97],"solved":[99],"very":[100],"easily":[101],"by":[102],"using":[103],"method.":[107],"II":[109],"written":[111,131],"in":[112],"language":[114],"more":[115],"familiar":[116],"to":[117,125,187,196],"control":[118],"specialists,":[120],"closer":[124],"programming.":[127],"All":[128],"parts":[129],"are":[130],"independent":[133],"papers":[134],"their":[136],"own":[137],"references":[138],"thus":[140,175],"can":[141],"be":[142,164],"read":[143],"independently.":[144],"However,":[145],"whole":[147],"comprises":[149],"finite-step":[153],"methods":[154],"DLP.":[156],"next":[158],"development":[159],"research":[162],"might":[163],"first":[165],"tests":[167],"on":[168],"behavior":[170],"judgement":[177],"its":[179],"efficiency,":[180],"second":[182],"extensions":[183],"approach":[186],"other":[188],"classes":[189],"strucured":[191],"(for":[194],"example,":[195],"DLP":[197],"problems":[198],"transportation":[201],"type).":[202]},"counts_by_year":[],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-09-16T00:00:00"}