Linear Programming and Network Flows / Edition 4

Hardcover (Print)
Rent
Rent from BN.com
$33.52
(Save 76%)
Est. Return Date: 06/23/2014
Buy New
Buy New from BN.com
$103.08
Used and New from Other Sellers
Used and New from Other Sellers
from $61.75
Usually ships in 1-2 business days
(Save 55%)
Other sellers (Hardcover)
  • All (17) from $61.75   
  • New (11) from $80.85   
  • Used (6) from $61.74   

Overview

The only book to treat both linear programming techniques and network flows under one cover, Linear Programming and Network Flows, Fourth Edition has been completely updated with the latest developments on the topic. This new edition continues to successfully emphasize modeling concepts, the design and analysis of algorithms, and implementation strategies for problems in a variety of fields, including industrial engineering, management science, operations research, computer science, and mathematics.

The book begins with basic results on linear algebra and convex analysis, and a geometrically motivated study of the structure of polyhedral sets is provided. Subsequent chapters include coverage of cycling in the simplex method, interior point methods, and sensitivity and parametric analysis. Newly added topics in the Fourth Edition include:

The cycling phenomenon in linear programming and the geometry of cycling

Duality relationships with cycling

Elaboration on stable factorizations and implementation strategies

Stabilized column generation and acceleration of Benders and Dantzig-Wolfe decomposition methods

Line search and dual ascent ideas for the out-of-kilter algorithm

Heap implementation comments, negative cost circuit insights, and additional convergence analyses for shortest path problems

The authors present concepts and techniques that are illustrated by numerical examples along with insights complete with detailed mathematical analysis and justification. An emphasis is placed on providing geometric viewpoints and economic interpretations as well as strengthening the understanding of the fundamental ideas. Each chapter is accompanied by Notes and Referencessections that provide historical developments in addition to current and future trends. Updated exercises allow readers to test their comprehension of the presented material, and extensive references provide resources for further study.

Linear Programming and network Flows, Fourth Edition is an excellent book for linear programming and network flow courses at the upper-undergraduate and graduate levels. It is also valuable resource for applied who would like to refresh their understanding of linear programming and network flow techniques.

Read More Show Less

Editorial Reviews

From the Publisher
“I am finding this book useful both for students and other readers interested in this field, welcomed in the operation research literature.” (Zentralbaltt MATH, June 2005)
Read More Show Less

Product Details

  • ISBN-13: 9780470462720
  • Publisher: Wiley
  • Publication date: 12/14/2009
  • Edition description: New Edition
  • Edition number: 4
  • Pages: 768
  • Product dimensions: 6.20 (w) x 9.30 (h) x 1.50 (d)

Meet the Author

MOKHTAR S. BAZARAA, PhD, is Managing Director for Global Logistics, The Logistics Institute, at Georgia Institute of Technology. He, along with Dr. Sherali, are coauthors of Nonlinear Programming: Theory and Algorithms (Wiley).

JOHN J. JARVIS, PhD, is Professor Emeritus at Georgia Institute of Technology.

HANIF D. SHERALI, PhD, is a W. Thomas Rice Chaired Professor of Engineering in the Grado Department of Industrial and Systems Engineering at Virginia Polytechnic and State University.

Read More Show Less

Table of Contents

1 Introduction

2 Linear Algebra, Convex Analysis, and Polyhedral Sets

3 The Simplex Method

4 Starting Solution and Convergence

5 Special Simplex Implementations and Optimality Conditions

6 Duality and Sensitivity Analysis

7 The Decomposition Principle

8 Complexity of the Simplex Algorithm and Polynomial-Time Algorithms

9 Minimal-Cost Network Flows

10 The Transportation and Assignment Problems

11 The Out-Of-Kilter Algorithm

12 Maximal Flow, Shortest Path, Multicommodity Flow, and Network Synthesis Problems

Bibliography

Index

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously
Sort by: Showing 1 Customer Reviews
  • Anonymous

    Posted September 28, 2010

    Difficult language and sequence to follow

    Unfriendly book written in a way to make you run away from all Linear and nonlinear programming

    Was this review helpful? Yes  No   Report this review
Sort by: Showing 1 Customer Reviews

If you find inappropriate content, please report it to Barnes & Noble
Why is this product inappropriate?
Comments (optional)