Interior Point Methods of Mathematical Programming

číslo produktu:117723

rezervuj

Interior Point Methods of Mathematical Programming

Terlaky

Rok vydania: 1996

Vydavateľ: Springer

Kniha je momentálne nedostupná.

V prípade dlhodobého záujmu si urobte REZERVÁCIU a my vám odložíme žiadaný kus.

O knihe:

"The book provides an overview of the research in interior point methods since the publication of N. Karmarkar's seminal paper in 1984. Leading international experts have contributed to the book with summaries of their relevant areas of specialization. Part I gives an overview of basic variants of interior point algorithms for linear programming. Duality-theory for LP and sensitivity analysis is developed. Results on the affine scale, path following, potential reduction, infeasible interior point methods and implementation strategies are discussed. Part II deals with nonlinear programming. Here necessary smoothness conditions are introduced and illustrated. Algorithms for general smooth convex problems, complementarity and semidefinite optimization problems are presented. The implementation of barrier methods for general nonlinear optimization problems is also considered. Part III covers some application areas such as combinatorial optimization, global optimization and VLSI design. Audience: Researchers and graduate students in mathematical programming, operations research, management science, combinatorics and industrial engineering; also professionals in industry who work on problems using linear programming."

Zaradenie do kategórii:

Podrobnosti o titule (výrobné údaje):

Vydavateľstvo: Springer

Rok vydania: 1996

ISBN: 978-0-7923-4201-4

(9780792342014)

Väzba: tvrdá