{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T05:55:57Z","timestamp":1648706157216},"reference-count":16,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Asia Pac. J. Oper. Res."],"published-print":{"date-parts":[[2004,3]]},"abstract":"<jats:p> Positive sensitivity analysis (PSA) is a sensitivity analysis method for linear programming that finds the range of perturbations within which positive value components of a given optimal solution remain positive. Its main advantage is that it is applicable to both an optimal basic and nonbasic optimal solution. <\/jats:p><jats:p> The first purpose of this paper is to present some properties of PSA that are useful for establishing the relationship between PSA and sensitivity analysis using optimal bases, and between PSA and sensitivity analysis using the optimal partition. We examine how the range of PSA varies according to the optimal solution used for PSA, and discuss the relationship between the ranges of PSA using different optimal solutions. The second purpose is to clarify the relationship between PSA and sensitivity analysis using an optimal basis, and the relationship between PSA and sensitivity analysis using the optimal partition. We show that sensitivity analysis using the optimal partition is a special case of PSA, and its properties can be derived from the properties of PSA. The comparison among the three sensitivity analysis methods will lead to a better understanding of the difference among sensitivity analysis methods. <\/jats:p>","DOI":"10.1142\/s0217595904000059","type":"journal-article","created":{"date-parts":[[2004,3,25]],"date-time":"2004-03-25T08:11:25Z","timestamp":1080202285000},"page":"53-68","source":"Crossref","is-referenced-by-count":4,"title":["POSITIVE SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING"],"prefix":"10.1142","volume":"21","author":[{"given":"CHAN-KYOO","family":"PARK","sequence":"first","affiliation":[{"name":"Department of IT Audit and Supervision,  National Computerization Agency, Mugyo-dong, Seoul 110-775, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"WOO-JE","family":"KIM","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering,  Daejin University, Pochun-gun, Gyonggi-do 487-711, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SANGWOOK","family":"LEE","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering,  Seoul National University, Seoul 151-742, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SOONDAL","family":"PARK","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering,  Seoul National University, Seoul 151-742, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,1,25]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758841"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(94)90074-4"},{"key":"rf3","volume-title":"Linear Programming and Extension","author":"Dantzig G. B.","year":"1963"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-5915.1982.tb00155.x"},{"key":"rf5","volume-title":"Postoptimal Analyses, Parametric Programming, and Related Topics","author":"Gal T.","year":"1979"},{"key":"rf6","doi-asserted-by":"crossref","unstructured":"A. J.\u00a0Goldman and A. W.\u00a0Tucker, Inequalities and Related Systems (Annals of Mathematical Studies, No. 38), Theory of linear programming, eds. H. W.\u00a0Kuhn and A. W.\u00a0Tucker (Princeton University Press, Princeton, New Jersey, 1956)\u00a0pp. 53\u201397.","DOI":"10.1515\/9781400881987-005"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623496310333"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(96)00172-5"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-5915.1984.tb01193.x"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00117-9"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585180"},{"key":"rf13","first-page":"65","volume":"92","author":"Monteiro R. D.","journal-title":"Mathematical Programming"},{"key":"rf14","volume-title":"Theory and Algorithms for Linear Optimization","author":"Roos C. T.","year":"1997"},{"key":"rf15","first-page":"343","volume":"152","author":"Sung K.","journal-title":"Linear Algebra and Its Applications"},{"key":"rf16","first-page":"1","volume":"13","author":"Ward J. E.","journal-title":"Journal of the Korean Operations Research and Management Science Society"},{"key":"rf17","first-page":"3","volume":"27","author":"Tapia R. A.","journal-title":"Annals of Operations Research"}],"container-title":["Asia-Pacific Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0217595904000059","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T18:42:09Z","timestamp":1565116929000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0217595904000059"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":16,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2012,1,25]]},"published-print":{"date-parts":[[2004,3]]}},"alternative-id":["10.1142\/S0217595904000059"],"URL":"https:\/\/doi.org\/10.1142\/s0217595904000059","relation":{},"ISSN":["0217-5959","1793-7019"],"issn-type":[{"value":"0217-5959","type":"print"},{"value":"1793-7019","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,3]]}}}