Linear Programming and its Applications / Edition 1

Linear Programming and its Applications / Edition 1

ISBN-10:
3540736700
ISBN-13:
9783540736707
Pub. Date:
09/14/2007
Publisher:
Springer Berlin Heidelberg
ISBN-10:
3540736700
ISBN-13:
9783540736707
Pub. Date:
09/14/2007
Publisher:
Springer Berlin Heidelberg
Linear Programming and its Applications / Edition 1

Linear Programming and its Applications / Edition 1

Hardcover

$169.99
Current price is , Original price is $169.99. You
$169.99 
  • SHIP THIS ITEM
    In stock. Ships in 1-2 days.
  • PICK UP IN STORE

    Your local store may have stock of this item.

  • SHIP THIS ITEM

    Temporarily Out of Stock Online

    Please check back later for updated availability.


Overview

Based on earlier work by a variety of authors in the 1930s and 1940s, the simplex method for solving linear programming problems was developed in 1947 by the American mathematician George B. Dantzig. Helped by the computer revolution, it has been described by some as the overwhelmingly most significant mathematical development of the last century. Owing to the simplex method, linear programming (or linear optimization, as some would have it) is pervasive in modern society for the planning and control of activities that are constrained by the availability of resources such as manpower, raw materials, budgets, and time. The purpose of this book is to describe the field of linear programming. While we aim to be reasonably complete in our treatment, we have given emphasis to the modeling aspects of the field. Accordingly, a number of applications are provided, where we guide the reader through the interactive process of mathematically modeling a particular practical situation, analyzing the consequences of the model formulated, and then revising the model in light of the results from the analysis.

Product Details

ISBN-13: 9783540736707
Publisher: Springer Berlin Heidelberg
Publication date: 09/14/2007
Edition description: 2007
Pages: 380
Product dimensions: 6.30(w) x 9.40(h) x 1.00(d)

Table of Contents

Linear Algebra.- Computational Complexity.- Applications.- The Simplex Method.- Duality.- Extensions of the Simplex Method.- Postoptimality Analyses.- Non-Simplex Based Solution Methods.- Problem Reformulations.- Multiobjective Programming.
From the B&N Reads Blog

Customer Reviews