Skip to main content
SpringerLink
Log in

A New Efficient Parallel Revised Relaxation Algorithm

  • Conference paper
Intelligent Computing (ICIC 2006)

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

Included in the following conference series:

  • 1200 Accesses

Abstract

The relaxation algorithm for linear programming is revised in this paper. Based on cluster structure, a parallel revised algorithm is presented. Its performance is analyzed. The experimental results on DAWNING 3000 are also given. Theoretical analysis and experimental results show that the revised relaxation algorithm improves the performance of the relaxation algorithm, and it has good parallelism and is very robust. Therefore, it can expect to be applied to the solution of the large-scale linear programming problems rising from practical application.

This work is supported by National Natural Science Foundation of China Grant #6027307, Grant #70471031 and Scientific Research Foundation of Naval University of Engineering Grant #HGDJJ05005.

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. Papadimitrious, C.H., Steiglitz, K.: Combinatorial Optimization. Algorithms and Complexity (1992)

    Google Scholar 

  2. Lyu, J., Luh, H., Lee, M.: Performance Analysis Of A Parallel Dantzig-Wolfe Decomposition Algorithm for Linear Programming. Computers and Mathematics with Applications 44, 1431–1437 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  3. Maros, I., Mitra, G.: Investigating the Sparse Simplex Algorithm On a Distributed Memory Multiprocessor. Parallel Computing 26, 151–170 (2000)

    Article  MATH  Google Scholar 

  4. Klabjan, D., Johnson, E., Nemhauser, G.: A Parallel Primal-dual Simplex Algorithm. Operation Research Letters 27, 47–55 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  5. Johnson, H.E.: Computational Results with a Primal-dual Sub problem Simplex Method. Operation Research Letter 25, 149–158 (1999)

    Article  MATH  Google Scholar 

  6. Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)

    MATH  Google Scholar 

  7. Gay, D.M.: E1ectronic Mail Distribution of Linear Programming Test Problems. Mathematical Programming Society COAL Newsletter 13, 10–12 (1985)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, Hubei, 430070, China

    Jianjun Zhang & Qinghua Li

  2. College of Science, Naval University of Engineering, Wuhan, Hubei, 430033, China

    Jianjun Zhang, Yexin Song & Yong Qu

Authors
  1. Jianjun Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qinghua Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yexin Song
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yong Qu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Intelligent Machines, Chinese Academy of Sciences, Hefei, Anhui, China

    De-Shuang Huang

  2. Carnegie Mellon University,  

    Kang Li

  3. School of Electronics, Electrical Engineering and Computer Science, Queen’s University Belfast, Stranmillis Road, BT9 5AH, Belfast, UK

    George William Irwin

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, J., Li, Q., Song, Y., Qu, Y. (2006). A New Efficient Parallel Revised Relaxation Algorithm. In: Huang, DS., Li, K., Irwin, G.W. (eds) Intelligent Computing. ICIC 2006. Lecture Notes in Computer Science, vol 4113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11816157_98

Download citation

  • DOI: https://doi.org/10.1007/11816157_98

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37271-4

  • Online ISBN: 978-3-540-37273-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation