{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T19:34:08Z","timestamp":1649014448031},"reference-count":25,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Asia Pac. J. Oper. Res."],"published-print":{"date-parts":[[2005,6]]},"abstract":"<jats:p> \u220a-Sensitivity analysis (\u220a-SA) is a kind of method to perform sensitivity analysis for linear programming. Its main advantage is that it can be directly applied for interior-point methods with a little computation. In this paper, we discuss the property of \u220a-SA analysis and its relationship with other sensitivity analysis methods. First, we present a new property of \u220a-SA, from which we derive a simplified formula for finding the characteristic region of \u220a-SA. Next, based on the simplified formula, we show that the characteristic region of \u220a-SA includes the characteristic region of Yildirim and Todd's method. Finally, we show that the characteristic region of \u220a-SA asymptotically becomes a subset of the characteristic region of sensitivity analysis using optimal partition. Our results imply that \u220a-SA can be used as a practical heuristic method for approximating the characteristic region of sensitivity analysis using optimal partition. <\/jats:p>","DOI":"10.1142\/s0217595905000467","type":"journal-article","created":{"date-parts":[[2005,6,9]],"date-time":"2005-06-09T07:25:56Z","timestamp":1118301956000},"page":"135-151","source":"Crossref","is-referenced-by-count":1,"title":["ON THE PROPERTIES OF \u220a-SENSITIVITY ANALYSIS FOR LINEAR PROGRAMMING"],"prefix":"10.1142","volume":"22","author":[{"given":"CHAN-KYOO","family":"PARK","sequence":"first","affiliation":[{"name":"Department of Management, Dongguk University, 3-26 Pil-dong, Jung-gu, Seoul 100-715, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"WOO-JE","family":"KIM","sequence":"additional","affiliation":[{"name":"Department of Industrial and Information Systems Engineering, Seoul National University of Technology, Seoul, 139-743, 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":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758841"},{"key":"rf2","volume-title":"Advances in sensitivity Analysis and Parametric Programming","author":"Berkelaar A. B.","year":"1997"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(94)90074-4"},{"key":"rf4","volume-title":"Linear Programming and Extension","author":"Dantzig G. B.","year":"1963"},{"key":"rf5","volume-title":"Postoptimal analyses, parametric programming, and related topics","author":"Gal T.","year":"1979"},{"key":"rf6","unstructured":"A. J.\u00a0Goldman and A. W.\u00a0Tucker, Inequalities and Relate Systems, Annals of Mathematical Studies, No. 38, eds. H. W.\u00a0Kuhn and A. W.\u00a0Tucker (Princeton University Press, Princeton, NJ, 1956)\u00a0pp. 53\u201397."},{"key":"rf7","volume-title":"Matrix Computations","author":"Golub G. H.","year":"1963"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580610"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(94)90075-2"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623497316798"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(96)00172-5"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00117-9"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-0427(02)00707-0"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582151"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585180"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1287\/moor.18.4.964"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01587075"},{"key":"rf18","first-page":"65","volume":"92","author":"Monteiro R. D. C.","journal-title":"Mathematical Programming"},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595904000059"},{"key":"rf21","first-page":"81","volume":"17","author":"Park S.","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"rf22","volume-title":"Theory and Algorithms for Linear Optimization","author":"Roos C. T.","year":"1997"},{"key":"rf23","volume-title":"Theory of Linear and Integer Programming","author":"Schrijver A.","year":"1986"},{"key":"rf24","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(89)90594-6"},{"key":"rf26","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/PL00011423","volume":"90","author":"Yildirim E. A.","journal-title":"Mathematical Programming"},{"key":"rf27","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623400382455"}],"container-title":["Asia-Pacific Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0217595905000467","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T18:42:52Z","timestamp":1565116972000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0217595905000467"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6]]},"references-count":25,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2005,6]]}},"alternative-id":["10.1142\/S0217595905000467"],"URL":"https:\/\/doi.org\/10.1142\/s0217595905000467","relation":{},"ISSN":["0217-5959","1793-7019"],"issn-type":[{"value":"0217-5959","type":"print"},{"value":"1793-7019","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,6]]}}}