Skip to main content
SpringerLink
Log in
Book cover

Semi-Infinite Programming pp 221–233Cite as

Analytic Center Based Cutting Plane Method for Linear Semi-Infinite Programming

  • Chapter

Part of the book series: Nonconvex Optimization and Its Applications ((NOIA,volume 57))

Abstract

In this paper, an analytic center based cutting plane method is proposed for solving linear semi-infinite programming problems. It is shown that a near optimal solution can be obtained by generating a polynomial number of cuts.

This is a preview of subscription content, 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   189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   249.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. J. Anderson and P. Nash. Linear Programming in Infinite-Dimensional Spaces, Wiley, 1987.

    MATH  Google Scholar 

  2. S. C. Fang and S. Y. Wu. An inexact approach to solving linear semi-infinite programming problems, Optimization, 28:291–299, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  3. K. Glashoff and S. A. Gustafson. Linear Optimization and Approximation, Springer-Verlag, 1982.

    Google Scholar 

  4. M. A. Goberna and M. A. López. Linear Semmi-Infinite Optimization, Wiley, 1998.

    Google Scholar 

  5. J. L. Goffin, Z. Q. Luo, and Y. Ye. On the complexity of a column generation algorithm for convex or quasiconvex feasibility problems. In W. W. Hager et al., editors, Large Scale Optimnization, pages 182–191, Kluwer, 1994.

    Chapter  Google Scholar 

  6. J. L. Goffin, Z. Luo and Y. Ye. Complexity analysis of an interior-point cutting plane method for convex feasibility problem, SIAM Journal on Optimization, 6:638–652, 1996.

    Article  MathSciNet  MATH  Google Scholar 

  7. S. A. Gustafson and K. O. Kortanek. Numerical treatment of a class of semi-infinite programming problems. Naval Research Logistics Quarterly, 20:477–504, 1973.

    Article  MathSciNet  MATH  Google Scholar 

  8. S. A. Gustafson and K. O. Kortanek. Computation of optimal experimental designs for air quality surveillance. In Jansen, P. J. et al., editors, Quantitative Modelle für Ökonomnisch-Okologische Analysen, pages 43–60, Verlag Anton Hain, Meisenheim, Germany, 1976.

    Google Scholar 

  9. R. Hettich and K. Kortanek. Semi-infinite programming: theory, method and applications, SIAM Review, 35:380–429, 1993.

    Article  MathSciNet  MATH  Google Scholar 

  10. H. C. Lai and S. Y. Wu. On linear semi-infinite programming problems: an algorithm, Numnerical Functional Analysis and Optimization, 13:287–304, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  11. C. J. Lin, S. C. Fang, and S. Y. Wu. An unconstrained convex programming approach for solving linear semi-infinite programming problems, SIAM Journal on Optimization, 8:443–456, 1998.

    Article  MathSciNet  MATH  Google Scholar 

  12. K. Roleff. A stable multiple exchange algorithm for linear SIP. In Hettich, R., editor, Semni-Infinite Programnmning: Proceedings of a Workshop, Volume 15 of Lecture Notes in Control and Information Sciences, pages 83–96, Springer-Verlag, 1979.

    Chapter  Google Scholar 

  13. S. Y. Wu, S. C. Fang, and C. J. Lin. Relaxed cutting plane method for solving linear semi-infinite programming problems, Journal of Optimnization Theory and Applications, 99:759–779, 1998.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Mathematics, National Cheng-Kung University, Tainan 700, Taiwan, R.O. C.

    Soon-Yi Wu

  2. Operations Research and Industrial Engineering, North Carolina State University, Raleigh, NC, 27695-7906, USA

    Shu-Cherng Fang

  3. Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, R.O.C.

    Chih-Jen Lin

Authors
  1. Soon-Yi Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shu-Cherng Fang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chih-Jen Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universidad de Alicante, Spain

    Miguel Á. Goberna  & Marco A. López  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Wu, SY., Fang, SC., Lin, CJ. (2001). Analytic Center Based Cutting Plane Method for Linear Semi-Infinite Programming. In: Goberna, M.Á., López, M.A. (eds) Semi-Infinite Programming. Nonconvex Optimization and Its Applications, vol 57. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3403-4_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-3403-4_10

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-5204-2

  • Online ISBN: 978-1-4757-3403-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation