Read While You Wait - Get immediate ebook access, if available*, when you order a print book

Applied Optimization

Interior Point Methods of Mathematical Programming

Editors: Terlaky, Tamas (Ed.)

Free Preview

Buy this book

eBook $229.00
price for USA in USD
  • ISBN 978-1-4613-3449-1
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $379.99
price for USA in USD
  • ISBN 978-0-7923-4201-4
  • Free shipping for individuals worldwide
  • Immediate ebook access, if available*, with your print order
  • Usually dispatched within 3 to 5 business days.
Softcover $299.99
price for USA in USD
  • ISBN 978-1-4613-3451-4
  • Free shipping for individuals worldwide
  • Immediate ebook access, if available*, with your print order
  • Usually dispatched within 3 to 5 business days.
About this book

One has to make everything as simple as possible but, never more simple. Albert Einstein Discovery consists of seeing what every­ body has seen and thinking what nobody has thought. Albert S. ent_Gyorgy; The primary goal of this book is to provide an introduction to the theory of Interior Point Methods (IPMs) in Mathematical Programming. At the same time, we try to present a quick overview of the impact of extensions of IPMs on smooth nonlinear optimization and to demonstrate the potential of IPMs for solving difficult practical problems. The Simplex Method has dominated the theory and practice of mathematical pro­ gramming since 1947 when Dantzig discovered it. In the fifties and sixties several attempts were made to develop alternative solution methods. At that time the prin­ cipal base of interior point methods was also developed, for example in the work of Frisch (1955), Caroll (1961), Huard (1967), Fiacco and McCormick (1968) and Dikin (1967). In 1972 Klee and Minty made explicit that in the worst case some variants of the simplex method may require an exponential amount of work to solve Linear Programming (LP) problems. This was at the time when complexity theory became a topic of great interest. People started to classify mathematical programming prob­ lems as efficiently (in polynomial time) solvable and as difficult (NP-hard) problems. For a while it remained open whether LP was solvable in polynomial time or not. The break-through resolution ofthis problem was obtained by Khachijan (1989).

Table of contents (13 chapters)

Table of contents (13 chapters)

Buy this book

eBook $229.00
price for USA in USD
  • ISBN 978-1-4613-3449-1
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $379.99
price for USA in USD
  • ISBN 978-0-7923-4201-4
  • Free shipping for individuals worldwide
  • Immediate ebook access, if available*, with your print order
  • Usually dispatched within 3 to 5 business days.
Softcover $299.99
price for USA in USD
  • ISBN 978-1-4613-3451-4
  • Free shipping for individuals worldwide
  • Immediate ebook access, if available*, with your print order
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Interior Point Methods of Mathematical Programming
Editors
  • Tamas Terlaky
Series Title
Applied Optimization
Series Volume
5
Copyright
1996
Publisher
Springer US
Copyright Holder
Kluwer Academic Publishers
eBook ISBN
978-1-4613-3449-1
DOI
10.1007/978-1-4613-3449-1
Hardcover ISBN
978-0-7923-4201-4
Softcover ISBN
978-1-4613-3451-4
Series ISSN
1384-6485
Edition Number
1
Number of Pages
XXII, 530
Topics

*immediately available upon purchase as print book shipments may be delayed due to the COVID-19 crisis. ebook access is temporary and does not include ownership of the ebook. Only valid for books with an ebook version. Springer Reference Works are not included.