買這商品的人也買了...
-
Discrete-Time Signal Processing, 2/e (修訂版)$1,060$1,007 -
SQL Server 2000 管理實務$680$578 -
C++ 標準程式庫 (The C++ Standard Library: A Tutorial and Reference)$860$679 -
Rhinoceros 2.0 產品設計$480$408 -
作業系統概念 (Operating System Concepts, 6/e Windows XP Update)$780$741 -
802.11 無線網路技術通論 (802.11 Wireless Networks: The Definitive Guide)$760$600 -
$1,140Computer Networks: A Systems Approach, 3/e (IE) (美國版ISBN:155860832X) -
Pro/ENGINEER Wildfire 零件設計基礎篇(上)$580$458 -
CCNA Self-Study: Interconnecting Cisco Network Devices (ICND) 640-811, 640-801, 2/e$2,340$2,223 -
PRO/ENGINEER Wildfire 零件設計基礎篇(下)$550$435 -
JBuilder X 程式設計快樂上手$590$502 -
人月神話：軟體專案管理之道 (20 週年紀念版)(The Mythical Man-Month: Essays on Software Engineering, Anniversary Edition, 2/e)$480$379 -
發誓學會 Flash MX 2004 ActionScript$620$558 -
Reporting Service 實戰演練$690$587 -
Introduction to the Personal Software Process (Paperback)$1,500$1,425 -
Head First Servlets & JSP$2,040$1,938 -
Pro/Engineer Wildfire 零件設計進階篇(下)$149$149 -
軟體測試理論與實作$520$406 -
$950Introduction to Object-Oriented Systems Analysis and Design With Uml and the Unified Process(精裝) -
VoIP 網路電話技術$350$298 -
Statistics for Managers Using Microsoft Excel, 4/e (美國版0131073893)$1,090$1,068 -
作業系統原理 (Silberschatz: Operating System Principles, 7/e)$780$741 -
我的e學園 PhotoImpact 影像繪圖樂$250$213 -
深入淺出軟體開發 (Head First Software Development)$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.
