Advanced basis construction in linear programming
- 36 Downloads
This paper considers basis construction in a linear program when the number of activities with basic status is not equal to the number of rows in the particular scenario. This arises when starting with an ‘advanced basis’, obtained from a solution to another scenario. The goal here is to provide a triangular-seeking algorithm that takes advantage of structural properties during the construction of a basis agenda. For completeness, some facts, which are known but have not been published, are given about choosing an advanced basis and about spikes.
Keywords and phrasesLinear programming basis construction matrix rearrangement
Unable to display preview. Download preview PDF.
- K. Darby-Dowman and G. Mitra, An investigation of algorithms used in the restructuring of linear programming basis matrices prior to inversion, 10th Int. Symp. on Mathematical Programming, Montreal, Canada (1979).Google Scholar
- E. Hellerman and D.C. Rarick, The partitioned pre-assigned pivot procedure (P4), in:Sparse Matrices and Their Applications, ed. D.J. Rose and R.A. Willoughby (Plenum Press, New York, 1972) p. 65.Google Scholar
- R.D. McBride, A bump triangular dynamic factorization algorithm for the simplex method, USC Working Paper No. 19, Los Angeles, California (1977).Google Scholar
- W. Orchard-Hays,Advanced Computing Techniques in Linear Programming (McGraw-Hill, New York, 1968).Google Scholar