Skip to main content

Simplex method for dynamic linear program solution

Nonlinear And Stochastic Programming

  • 159 Accesses

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dantzig, G.B., Linear Programming and Extensions, Princeton Univ. Press, Princeton, N.J., 1963.

    Google Scholar 

  2. Kantorovich, L.V., The Best Use of Economic Resources, Harvard University Press, Cambridge, Mass., 1965.

    Google Scholar 

  3. Propoi, A.I., Problems of DLP, RM-76-78, International Institute for Applied Systems Analysis, Laxenburg, Austria, 1976.

    Google Scholar 

  4. Propoi, A.I., Dual Systems of DLP, RR-77-9, International Institute for Applied Systems Analysis, Laxenburg, Austria, 1977.

    Google Scholar 

  5. Propoi, A.I. and V.E. Krivonozhko, The Dynamic Simplex Method, RM-77-24, International Institute for Applied Systems Analysis, Laxenburg, Austria, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

J. Stoer

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag

About this paper

Cite this paper

Krivonozhko, V.E., Propoi, A.I. (1978). Simplex method for dynamic linear program solution. In: Stoer, J. (eds) Optimization Techniques. Lecture Notes in Control and Information Sciences, vol 7. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0006516

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08708-3

  • Online ISBN: 978-3-540-35890-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics