株式会社極東書店トップ > 商品一覧 > Large Scale Linear and Integer Optimization: A Unified Approach. Softcover reprint of the original 1st ed. 1999
商品詳細
Large Scale Linear and Integer Optimization: A Unified Approach. Softcover reprint of the original 1st ed. 1999
・ISBN 978-1-4613-7258-5 paper EUR 549.99
¥147,011.- (税込) ※(※)価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
お気に入り
★★★
| 著者・編者 | Martin, Richard Kipp, |
|---|---|
| 出版社 | (Springer-Verlag New York Inc., US) |
| 出版年月 | 2012 |
| ページ数 | 740 pp. |
| 言語 | ENG |
| ニュース番号 | <A04-81228> |
解説
This is a textbook about linear and integer linear optimization. There is a growing need in industries such as airline, trucking, and financial engineering to solve very large linear and integer linear optimization problems. Building these models requires uniquely trained individuals. Not only must they have a thorough understanding of the theory behind mathematical programming, they must have substantial knowledge of how to solve very large models in today's computing environment. The major goal of the book is to develop the theory of linear and integer linear optimization in a unified manner and then demonstrate how to use this theory in a modern computing environment to solve very large real world problems. After presenting introductory material in Part I, Part II of this book is de- voted to the theory of linear and integer linear optimization. This theory is developed using two simple, but unifying ideas: projection and inverse projec- tion. Through projection we take a system of linear inequalities and replace some of the variables with additional linear inequalities. Inverse projection, the dual of this process, involves replacing linear inequalities with additional variables. Fundamental results such as weak and strong duality, theorems of the alternative, complementary slackness, sensitivity analysis, finite basis the- orems, etc. are all explained using projection or inverse projection. Indeed, a unique feature of this book is that these fundamental results are developed and explained before the simplex and interior point algorithms are presented.