| 書目名稱 | Interior Point Methods of Mathematical Programming |
| 編輯 | Tamás Terlaky |
| 視頻video | http://file.papertrans.cn/472/471044/471044.mp4 |
| 叢書名稱 | Applied Optimization |
| 圖書封面 |  |
| 描述 | 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 top |
| 出版日期 | Book 19961st edition |
| 關(guān)鍵詞 | algorithms; combinatorial optimization; complementarity; complexity; global optimization; linear optimiza |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-1-4613-3449-1 |
| isbn_softcover | 978-1-4613-3451-4 |
| isbn_ebook | 978-1-4613-3449-1Series ISSN 1384-6485 |
| issn_series | 1384-6485 |
| copyright | Kluwer Academic Publishers 1996 |
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2026-2-7 00:40
發(fā)表于 2025-3-21 16:37:49
