Skip to main content

Non-Simplex Based Solution Methods

  • Chapter
Linear Programming and its Applications
  • 2444 Accesses

Abstract

So far, we have concentrated on the simplex method as the solution technique of choice for linear programming problems. While being extremely successful in practice for the last half century, the simplex method is by no means the only solution method for linear programming. Interestingly enough, the first alternative solution technique to the simplex method, a method by Brown and Koopmans (1951), was published in the same volume in which Dantzig presented his simplex method in 1951.

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.

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(2007). Non-Simplex Based Solution Methods. In: Linear Programming and its Applications. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73671-4_9

Download citation

Publish with us

Policies and ethics