Linear Programming and Network Flows, 3/e

Mokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali

  • 出版商: Wiley
  • 出版日期: 2004-12-17
  • 售價: $4,800
  • 貴賓價: 9.5$4,560
  • 語言: 英文
  • 頁數: 744
  • 裝訂: Hardcover
  • ISBN: 0471485993
  • ISBN-13: 9780471485995
  • 相關分類: R 語言
  • 已過版

買這商品的人也買了...

相關主題

商品描述

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.