Abstract
In this paper we first generalize the concept of pivoting index, proposed by Pan, to the standard form of linear programming problems by considering its dual problem. Then, we develop a practical variant of criss-cross pivot algorithm for linear programming problem. The new criss-cross algorithm is not only finiteness, but also more efficient in practice.
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
Zionts, S.: The criss-cross method for solving linear programming problems. Management Science 15, 426–445 (1969)
Terlaky, T.: A convergent criss-cross method. Mathematics of operationsforschung und statistik series Optimazation 16, 683–690 (1985)
Wang, Z.: A conformal elimination-free algorithm for oriented matroid programming. Annals of Mathematics 8, 51–59 (1987)
Illés, T., Terlaky, T.: Pivot versus interior point methods: Pros and cons. European Journal of Operational Research 140, 170–190 (2002)
Pan, P.Q.: Practical finite pivoting rules for the simplex method. OR Spektrum 12, 219–225 (1990)
Pan, P.Q., Li, W., Wang, Y.: A Phase-I Algorithm Using the Most-Obtuse-Angle Rule for the Basis-Deficiency-Allowing Dual Simplex Method. OR Transaction 8, 88–96 (2004)
Li, W.: A Note on Two Direct Methods in Linear Programming. European Journal of Operational Research 158, 262–265 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, W. (2010). Practical Criss-Cross Method for Linear Programming. In: Zhang, L., Lu, BL., Kwok, J. (eds) Advances in Neural Networks - ISNN 2010. ISNN 2010. Lecture Notes in Computer Science, vol 6063. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13278-0_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-13278-0_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13277-3
Online ISBN: 978-3-642-13278-0
eBook Packages: Computer ScienceComputer Science (R0)