你好! Shipping to Taiwan with premium packaging for just NT$300 

Ship to
Taiwan
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada interior point methods of mathematical programming
Type
Physical Book
Illustrated by
Publisher
Author
Year
2011
Language
English
Pages
530
Format
Paperback
Dimensions
23.4 x 15.6 x 2.9 cm
Weight
0.77 kg.
ISBN
1461334519
ISBN13
9781461334514
Categories

interior point methods of mathematical programming

Tamás Terlaky (Illustrated by) · Springer · Paperback

interior point methods of mathematical programming - Terlaky, Tamás

Cheaper New Book Imported to Taiwan
Delivery: 16 Sep - 29 Sep Shipping: 12 to 16 business days.
NT$ 9,505
Faster New Book Imported to Taiwan
Delivery: 04 Sep - 14 Sep Shipping: 4 to 5 business days.
NT$ 12,587
NT$ 9,505

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Synopsis "interior point methods of mathematical programming"

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).

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews