Skip to main content
SpringerLink
Log in

On the convergence of the modified tui algorithm for minimizing a concave function on a bounded convex polyhedron

  • Nonlinear And Stochastic Programming
  • Conference paper
  • First Online:
Optimization Techniques

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

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.

References

  1. Hausdorff, F., Set Theory, 2nd edition, Chealsea Publishing Co., New York, 1962.

    Google Scholar 

  2. Tui, H., "Concave Programming Under Linear Constraints," Soviet Mathematics, July–December, 1964.

    Google Scholar 

  3. Zwart, P., "Nonlinear Programming: Counterexamples to Global Optimization Algorithms by Ritter and Tui," Operations Research, Vol. 21, 1973.

    Google Scholar 

  4. Zwart, P., "Global Maximization of a Convex Function with Linear Inequality Constraints," Operations Research, Vol. 22, May–June, 1974.

    Google Scholar 

  5. Dantzig, G.B., Linear Programming and Extensions, Princeton University Press, 1963.

    Google Scholar 

  6. Frank, M. and P. Wolfe, "An Algorithm for Quadratic Programming," Naval Research Logistics Quarterly, vol. 3, 1956.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bell Laboratories, 07733, Holmdel, NJ, USA

    S. Bali

  2. Department of System Science, University of California, 90024, Los Angeles, CA, USA

    S. E. Jacobsen

Authors
  1. S. Bali
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. E. Jacobsen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Stoer

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag

About this paper

Cite this paper

Bali, S., Jacobsen, S.E. (1978). On the convergence of the modified tui algorithm for minimizing a concave function on a bounded convex polyhedron. In: Stoer, J. (eds) Optimization Techniques. Lecture Notes in Control and Information Sciences, vol 7. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0006509

Download citation

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

  • 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

Search

Navigation