Abstract
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.
Similar content being viewed by others
References
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).
I.S. Duff, On permutations to block triangular form, J. Inst. Maths. Applics. 19(1977)339.
J.J.H. Forrest and J.A. Tomlin, Updating triangular factors of the basis to maintain sparsity in the product form simplex method, Math. Progr. 2(1972)263.
H.J. Greenberg and D.C. Rarick, Determining GUB sets via an invert agenda algorithm, Math. Progr. 7(1977)240.
E. Hellerman and D.C. Rarick, Reinversion with the pre-assigned pivot procedure, Math. Progr. 1(1971)195.
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.
J.E. Hopcroft and R.M. Karp, An n5/2 algorithm for maximum matchings in bipartite graphs, Siam J. Comput. 2(1973)225.
J.E. Kalen, Aspects of large-scale in-core linear programming,Proc. 1971 Ann. Conf. (ACM, New York, 1971) p. 304.
R.D. McBride, A spike collective dynamic factorization algorithm for the simplex method, Mgt. Sci. 24(1978)1031.
R.D. McBride, A bump triangular dynamic factorization algorithm for the simplex method, USC Working Paper No. 19, Los Angeles, California (1977).
W. Orchard-Hays,Advanced Computing Techniques in Linear Programming (McGraw-Hill, New York, 1968).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Greenberg, H.J. Advanced basis construction in linear programming. Ann Oper Res 5, 413–424 (1986). https://doi.org/10.1007/BF02739231
Issue Date:
DOI: https://doi.org/10.1007/BF02739231