Skip to main content
SpringerLink
Log in

Symbolic generation of an optimal Karmarkar's projective algorithm for sparse linear programs

  • Nonlinear Optimization
  • Conference paper
  • First Online:
System Modelling and Optimization

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

  • 159 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. References

  1. Dantzig, G., "Linear Programming and Extensions", Princeton University Press (1963).

    Google Scholar 

  2. Karmarkar, N., "A New Polynomial-time Algorithm for Linear Programming", Combinatorica, Vol.4(1984).

    Google Scholar 

  3. Kojima, M. et al., "An efficient implementation of Karmarkar's Recovering Optimal Dual Solutions in Karmarkar's Polynomial Algorithm for Linear Programming", Mathematical Programming, 39(1987).

    Google Scholar 

  4. Tomlin, J.A., "An Experimental Approach to Karmarkar's Projective Method for Linear Programming", Mathematical Programming, 37(1987).

    Google Scholar 

  5. Ye.Y., et al., "Recovering Optimal Dual Solutions in Karmarkar's Polynomial Algorithm for Linear Programming", Mathematical Programming, 39(1987).

    Google Scholar 

  6. Gustavson, F.G., et al., "Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations", ACM, 17(1970).

    Google Scholar 

  7. Pissanetzky, S., "Sparse Matrix Technology", Academic Press (1984).

    Google Scholar 

  8. Chvatal, V., "Linear Programming", Freeman (1983).

    Google Scholar 

  9. Adler, I., et al., "An Implementation of Karmarkar's Algorithm for Linear Programming", Working Paper, OR Center, U. of California (1986).

    Google Scholar 

  10. Iri, M., et al., "A Multiplicative Barrier Function Method for Linear Programming", Algorithmica, 1(1986).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Engineering, Hokkaido Institute of Technology, 419-2 Maeda, Teine-ku, 006, Sapporo, Japan

    Takahumi Oohori

  2. Faculty of Engineering, Hokkaido University, Kita 13, Nishi 8, Kita-ku, 060, Sapporo, Japan

    Azuma Ohuchi

Authors
  1. Takahumi Oohori
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Azuma Ohuchi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

H. -J. Sebastian K. Tammer

Rights and permissions

Reprints and permissions

Copyright information

© 1990 International Federation for Information Processing

About this paper

Cite this paper

Oohori, T., Ohuchi, A. (1990). Symbolic generation of an optimal Karmarkar's projective algorithm for sparse linear programs. In: Sebastian, H.J., Tammer, K. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 143. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0008370

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52659-9

  • Online ISBN: 978-3-540-47095-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation