買這商品的人也買了...
-
$1,060$1,007 -
$680$537 -
$860$679 -
$480$379 -
$780$741 -
$760$600 -
$1,176Computer Networks: A Systems Approach, 3/e (IE) (美國版ISBN:155860832X)
-
$580$493 -
$2,390$2,271 -
$550$468 -
$590$466 -
$480$379 -
$620$527 -
$690$587 -
$1,500$1,425 -
$2,090$1,986 -
$149$149 -
$520$406 -
$980Introduction to Object-Oriented Systems Analysis and Design With Uml and the Unified Process(精裝)
-
$350$277 -
$1,090$1,068 -
$780$741 -
$250$198 -
$680$537 -
$490$417
商品描述
Description
Linear Programming and Network Flows, now in its third edition, addresses the problem of minimizing or maximizing a linear function in the presence of linear equality or inequility constraints. This book:
- Provides methods for modeling complex problems via effective algorithms on modern computers.
- Presents the general theory and characteristics of optimization problems, along with effective solution algorithms.
- Explores linear programming (LP) and network flows, employing polynomial-time algorithms and various specializations of the simplex method.
Table of Contents
One: Introduction.
Two: Linear Algebra, Convex Analysis, and Polyhedral Sets.
Three: The Simplex Method.
Four: Starting Solution and Convergence.
Five: Special Simplex Implementations and Optimality Conditions.
Six: Duality and Sensitivity Analysis.
Seven: The Decomposition Principle.
Eight: Complexity of the Simplex Algorithms.
Nine: Minimal-Cost Network Flows.
Ten: The Transportation and Assignment Problems.
Eleven: The Out-of-Kilter Algorithm.
Twelve: Maximal Flow, Shortest Path, Multicommodity Flow, and Network Synthesis Problems.
Bibliography.
Index.
商品描述(中文翻譯)
描述
《線性規劃與網路流》,現在已進入第三版,針對在存在線性等式或不等式約束的情況下,最小化或最大化線性函數的問題進行探討。本書:
- 提供透過現代計算機上的有效算法來建模複雜問題的方法。
- 提出優化問題的一般理論和特徵,以及有效的解決算法。
- 探索線性規劃(LP)和網路流,採用多項式時間算法和各種單純形法的專門化。
目錄
一:介紹。
二:線性代數、凸分析與多面體集合。
三:單純形法。
四:起始解與收斂。
五:特殊單純形實現與最優條件。
六:對偶性與敏感度分析。
七:分解原則。
八:單純形算法的複雜性。
九:最小成本網路流。
十:運輸與指派問題。
十一:不平衡算法。
十二:最大流、最短路徑、多商品流與網路合成問題。
參考文獻。
索引。