Skip to main content

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

  • 516 Accesses

Abstract

When a blind man hits a wall, what would he do? A popular method is to find a way along the wall. In this chapter, we use this idea to study linearly constrained optimization problems.

I respect only those who resist me, but I cannot tolerate them.

Charles de Gaulle

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Du, DZ., Pardalos, P.M., Wu, W. (2001). Hitting Walls. In: Du, DZ., Pardalos, P.M., Wu, W. (eds) Mathematical Theory of Optimization. Nonconvex Optimization and Its Applications, vol 56. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-5795-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-5795-8_4

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-5202-8

  • Online ISBN: 978-1-4757-5795-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics