Skip to main content
SpringerLink
Log in

Practical Criss-Cross Method for Linear Programming

  • Conference paper
Advances in Neural Networks - ISNN 2010 (ISNN 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6063))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Zionts, S.: The criss-cross method for solving linear programming problems. Management Science 15, 426–445 (1969)

    Article  Google Scholar 

  2. Terlaky, T.: A convergent criss-cross method. Mathematics of operationsforschung und statistik series Optimazation 16, 683–690 (1985)

    MATH  MathSciNet  Google Scholar 

  3. Wang, Z.: A conformal elimination-free algorithm for oriented matroid programming. Annals of Mathematics 8, 51–59 (1987)

    Google Scholar 

  4. Illés, T., Terlaky, T.: Pivot versus interior point methods: Pros and cons. European Journal of Operational Research 140, 170–190 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  5. Pan, P.Q.: Practical finite pivoting rules for the simplex method. OR Spektrum 12, 219–225 (1990)

    Article  Google Scholar 

  6. 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)

    Google Scholar 

  7. Li, W.: A Note on Two Direct Methods in Linear Programming. European Journal of Operational Research 158, 262–265 (2004)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Operational Research & Cybernetics, Hangzhou Dianzi University, Hangzhou, 310018, P.R. China

    Wei Li

Authors
  1. Wei Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Shanghai Jiao Tong University, 800 Dongchuan Road, 200240, Shanghai, China

    Liqing Zhang

  2. Department of Computer Science and Engineering, Shanghai Jiao Tong University, 800, Dongchuan Road, 200240, Shanghai, China

    Bao-Liang Lu

  3. Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Clear Water bay, Kowloon, Hong Kong, China

    James Kwok

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation