Skip to main content
SpringerLink
Log in

A Reduced Subgradient Algorithm for Network Flow Problems with Convex Nondifferentiable Costs

  • Conference paper
Nondifferentiable Optimization: Motivations and Applications

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 255))

  • 92 Accesses

Abstract

Consider a single-commodity directed network with m nodes and n arcs.

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

  • Bihain, A., Nguyen, V.H., and Strodiot, J.J. (1984). A reduced subgradient algorithm. Internal report 84/3. Department of Mathematics. Facultés Universitaires N.-D. de la Paix, Namur, Belgium.

    Google Scholar 

  • Dembo, R.S., and Klincewicz, J.G. (1981). A scaled reduced gradient algorithm for network flow problems with convex separable costs. Mathematical Programming Study, 15: 125–147.

    Article  Google Scholar 

  • Hanscom, M., Lafond, L., Lasdon, L., and Pronovost, G. (1980). Modeling and resolution of the medium term energy generation planning problem for a large hydro-electric system. Management Science, 26: 659–668.

    Article  Google Scholar 

  • Kennington, J., and Helgason, R. (1980). Algorithms for network programming. Wiley, New York.

    Google Scholar 

  • Murtagh, B., and Saunders, M. (1978). Large scale linearly constrained optimization. Mathematical Programming, 14: 41–72.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IREQ, Varennes, Canada

    M. A. Hanscom

  2. FNDP, Rempart de la Viérge 8, 5000, Namur, Belgium

    V. H. Nguyen & J. J. Strodiot

Authors
  1. M. A. Hanscom
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. H. Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. J. Strodiot
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. International Institute for Applied Systems Analysis, Schlossplatz 1, A-2361, Laxenburg, Austria

    Vladimir F. Demyanov

  2. Applied Mathematical Department, Leningrad University, Leningrad, USSR

    Vladimir F. Demyanov

  3. Institut für Statistik und Mathematische Wirtschaftstheorie, Universität Karlsruhe, Postfach 6380, D-7500, Karlsruhe 1, Germany

    Diethard Pallaschke

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hanscom, M.A., Nguyen, V.H., Strodiot, J.J. (1985). A Reduced Subgradient Algorithm for Network Flow Problems with Convex Nondifferentiable Costs. In: Demyanov, V.F., Pallaschke, D. (eds) Nondifferentiable Optimization: Motivations and Applications. Lecture Notes in Economics and Mathematical Systems, vol 255. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-12603-5_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-12603-5_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15979-7

  • Online ISBN: 978-3-662-12603-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation