Skip to main content

Nonlinear multicommodity network flows through primal partitioning and comparison with alternative methods

  • Contributed Papers
  • Conference paper
  • First Online:
System Modelling and Optimization

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 197))

Abstract

This paper presents a specialized code for solving the linear and nonlinear multicommodity network flow problem with linear side constraints using primal partitioning techniques. The computational performance of the program developed is reported and compared with that of another specialized code for the same problem —based on price-directive decomposition— and also compared to the performance of a general purpose nonlinear optimization package. Test problems of many sizes corresponding to real cases of nonlinear multicommodity network flows have been employed.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Ali, A., R.V. Helgason, J.L. Kennington & H. Lall. 1980. Computational comparison among three multicommodity network flow algorithms. Operations Research, v. 28, pp. 995–1000

    Article  MATH  MathSciNet  Google Scholar 

  2. Bradley, G.H.; G.G. Brown & G.W. Graves. 1977. Design and implementation of large scale primal transshipment algorithms. Management Science, Vol.24, N.1, pp. 1–34.

    Article  MATH  Google Scholar 

  3. Dembo, R.S. and T. Steihaug. 1983. Truncated-Newton algorithms for large-scale unconstrained optimization. Mathematical Programming, v.26, pp. 190–212.

    Article  MATH  MathSciNet  Google Scholar 

  4. Hellerman, E and D. Rarick. 1971. Reinversion with the preassigned pivot procedure. Mathematical Programming, v. 1, pp. 195–216.

    Article  MATH  MathSciNet  Google Scholar 

  5. Kennington, J.L. and R.V. Helgason. 1980. Algorithms for network programming. John Wiley & sons.

    Google Scholar 

  6. Murtagh, B.A. and M.A. Saunders. 1978. Large-scale linearly constrained optimization. Mathematical Programming, v. 14, pp. 41–72.

    Article  MATH  MathSciNet  Google Scholar 

  7. Murtagh, B.A. and M.A. Saunders. 1983. MINOS 5.0. User's guide. Dpt. of Operations Research, Standford University, CA 9430, USA.

    Google Scholar 

  8. Nabona, N. 1993. Multicommodity network flow model for long-term hydro-generation optimization. IEEE Trans. on Power Systems, v. 8, num. 2, pp. 395–404.

    Article  Google Scholar 

  9. Nabona, N. and J.M. Verdejo. 1992. Numerical implementation of nonlinear multicommodity network flows with linear side constraints through price-directive decomposition, in P. Kall (Ed.) System Modelling and Optimization, Proceedings of the 15th IFIP Conference, Zurich. Springer-Verlag. pp. 311–320.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jacques Henry Jean-Pierre Yvon

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag

About this paper

Cite this paper

Castro, J., Nabona, N. (1994). Nonlinear multicommodity network flows through primal partitioning and comparison with alternative methods. In: Henry, J., Yvon, JP. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035537

Download citation

  • DOI: https://doi.org/10.1007/BFb0035537

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19893-2

  • Online ISBN: 978-3-540-39337-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics