Abstract
In this chapter we describe the optimal set approach for sensitivity analysis for LP. We show that optimal partitions and optimal sets remain constant between two consecutive transition-points of the optimal value function. The advantage of using this approach instead of the classical approach (using optimal bases) is shown. Moreover, we present an algorithm to compute the partitions, optimal sets and the optimal value function. This is a new algorithm and uses primal and dual optimal solutions. We also extend some of the results to parametric quadratic programming, and discuss differences and resemblances with the linear programming case.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adler, I., R. Monteiro: A geometric view of parametric linear programming, Algoritmica 8(1992)161–176.
Anstreicher, K.M., D. Hertog, C. Roos and T. Terlaky: A long step barrier method for convex quadratic programming, Algorithmica 10(1993)365–382.
Bereanu, D.: A property of convex piecewise linear functions with applications to mathematical programming, Unternehmensforschung 9(1965)112–119.
Berkelaar, A.B., B. Jansen, C. Roos and T. Terlaky: Sensitivity analysis for degenerate quadratic programming. Report 9611/A, Econometric Institute, Erasmus University Rotterdam, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands 1996.
Carpenter, T.J., I.J. Lustig, J.M. Mulvey and D.F. Shanno: Higher order predictor-corrector interior point methods with application to quadratic objectives, SIAM Journal on Optimization 3(1993)696–725.
Charnes, A., W. Cooper: Systems evaluation and repricing theorems, Management Science 9(1962)209–228.
Dinkelbach, W.: Sensitivitätsanalysen und parametrische programmierung. Springer-Verlag, New York, USA 1969.
Dorn, W.: Duality in quadratic programming, Quarterly of Applied Mathematics 18(1960)155–162.
Gal, T.: Postoptimal analyses, parametric programming and related topics. W. de Gruyter, New York, 2nd edition 1995.
Goldman, A., A. Tucker: “Theory of linear programming.” In Kuhn, H., A. Tucker (eds.), Linear Inequalities and Related Systems, Annals of Mathematical Studies Number 38, 53–97. Princeton University Press, Princeton, New Jersey 1956.
Greenberg, H.: An analysis of degeneracy, Naval Research Logistics Quarterly 33(1986)635–655.
Güler, O., Y. Ye: Interior point algorithms for LP generate strictly complementary solutions. Talk given at the ORSA/TIMS Joint National Meeting in Nashville, Tennessee, USA, Dept. of Management Science, University of Iowa, Iowa City, IA 52242, USA 1991.
Güler, O., Y. Ye: Convergence behavior of interior-point algorithms, Mathematical Programming 60(1993)215–228.
Hertog, D.: Interior Point Approach to Linear, Quadratic and Convex Programming. volume 277 of Mathematics and its Applications, Kluwer Academic Publishers, Dordrecht, The Netherlands 1994.
Jansen, B.: Interior Point Techniques in Optimization. Complexity, Sensitivity and Algorithms. PhD thesis, Faculty of Mathematics and Informatics, TU Delft, NL-2628 BL Delft, The Netherlands 1995.
Jansen, B., C. Roos and T. Terlaky: An interior point approach to postoptimal and parametric analysis in linear programming. Technical Report 92–21, Faculty of Technical Mathematics and Informatics, TU Delft, NL-2628 CD Delft, The Netherlands 1992.
Karmarkar, N.K.: A new polynomial-time algorithm for linear programming, Combinatorica 4(1984)373–395.
Kelly, J.: Parametric programming and the primal-dual algorithm, Operations Research 7(1959)327–334.
Kriens, J., J. van Lieshout: Notes on the markowitz portfolio selection method, Statistica Neerlandica 42(1988)181–191.
Markowitz, H.: The optimization of a quadratic function subject to linear constraints, Naval Research Logistics Quarterly 3(1956)111–133.
McLinden, L.: The analogue of Moreau’s proximation theorem, with applications to the nonlinear complementarity problem, Pacific Journal of Mathematics 88(1980)101–161.
Mehrotra, S., R.D.C. Monteiro: Parametric and range analysis for interior point methods. Technical Report, Dept. of Systems and Industrial Engineering, University of Arizona, Tucson, AZ 85721, USA 1992.
Murty, K.: Computational complexity of parametric linear programming, Mathematical Programming 19(1980)213–219.
Rubin, D., H. Wagner: Shadow prices: tips and traps for managers and instructors, Interfaces 20(1990)150–157.
Vanderbei, R.J.: LOQO: An interior point code for quadratic programming. Technical Report, Dept. of Civil Engineering and Operations Research, Princeton University, Princeton, NJ 08544, USA 1995.
Vörös, J.: Portfolio analysis: an analytic derivation of the efficient portfolio frontier, European Journal of Operations Research 23(1986)294–300.
Vörös, J.: The explicit derivation of the efficient portfolio frontier in the case of degeneracy and general singularity, European Journal of Operations Research 32(1987)302–310.
Ward, J., R. Wendell: Approaches to sensitivity analysis in linear programming, Annals of Operations Research 27(1990)3–38.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Berkelaar, A.B., Roos, K., Terlaky, T. (1997). The Optimal Set and Optimal Partition Approach to Linear and Quadratic Programming. In: Gal, T., Greenberg, H.J. (eds) Advances in Sensitivity Analysis and Parametic Programming. International Series in Operations Research & Management Science, vol 6. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-6103-3_6
Download citation
DOI: https://doi.org/10.1007/978-1-4615-6103-3_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7796-2
Online ISBN: 978-1-4615-6103-3
eBook Packages: Springer Book Archive