1 |
Kim, W. J., C.-K. Park, S. Park, 'An e-sensitivity analysis in the primaldual interior point method,' European Journal of Operational Research 116 (1999), 629-639
DOI
ScienceOn
|
2 |
Yang, B. H., 'A study on sensitivity analysis for a non-extreme optimal solution in linear programming,' Ph. D. Dissertation, Seoul National University, Republic of Korea, 1990
|
3 |
Tapia, R. A. and Y. Zhang, 'An optimal-basis identification technique for interior-point linear programming algorithms,' Linear Algebra and Its Applications 152 (1991), 343-363
DOI
ScienceOn
|
4 |
Adler, I. and R. D. C. Monteiro, 'A geometric view of parametric linear programming,' Algorithmica 8 (1992), 161-176
DOI
|
5 |
Park, C.-K, W.-J. Kim, S. Park, 'Generalized sensitivity analysis at a degenerate optimal solution,' Journal of the Korean Operations Research and Management Science Society 25, 4 (2000), 1-14
과학기술학회마을
|
6 |
Park, C.-K, W.-J. Kim, S. Lee, S. Park, 'Positive sensitivity analysis in linear programming,' Asia-Pacific Journal of Operational Research, 2004, To appear
DOI
ScienceOn
|
7 |
Dantzig, G. B., Linear Programming and Extension, Princeston University Press, 1963
|
8 |
Jansen, B., J. J. de Jong, C. Roos, T. Terlaky, 'Sensitivity analysis in linear programming: just be careful!,' European Journal of Operational Research 101 (1997), 15-28
DOI
ScienceOn
|
9 |
Gal, T., Postoptimal analyses, parametric programming, and related topics, MacGraw-Hill, New York, 1979
|
10 |
Bixby, R. E. and M. J. Saltzman, 'Recovering an optimal LP basis from an interior point solution,' Operations Research Letters 15 (1994), 169-178
DOI
ScienceOn
|
11 |
Golub, G. H. and C. F. Van Loan, Matrix Computations, John Hopkins University Press, 1983
|
12 |
Mehrotra, S. and Y. Ye, 'Finding an interior point in the optimal face of linear programs,' Mathematical Programming 62 (1993), 497-515
DOI
|
13 |
Stewart, G. W., 'On scaled projections and pseudo inverses,' Linear Algebra and its Applications 112 (1989), 189-193
DOI
ScienceOn
|