Linear Programming

ISBN-10: 0716715872
ISBN-13: 9780716715870
Edition: 1984
Authors: Vasek Chvatal
List price: $84.99
30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy

what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!
You could win $10,000

Get an entry for every item you buy, rent, or sell.

Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
Periodic Table Online content $4.95 $1.99
Add to cart
Study Briefs
Calculus 1 Online content $4.95 $1.99
Add to cart
Study Briefs
Robert's Rules of Order Online content $4.95 $1.99
Add to cart
Study Briefs
Aromatherapy Basics Online content $4.95 $1.99

Customers also bought

Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $84.99
Copyright year: 1984
Publisher: W. H. Freeman & Company
Publication date: 9/15/1983
Binding: Paperback
Pages: 478
Size: 6.50" wide x 9.25" long x 1.00" tall
Weight: 1.584

Basic Theory
Introduction
How the Simplex Method Works
Pitfalls and How to Avoid Them
How Fast Is the Simplex Method?
The Duality Theorem
Gaussian Elimination and Matrices
The Revised Simplex Method
General LP Problems: Solutions by the Simplex Method
General LP Problems: Theorems on Duality and Infeasibility
Sensitivity Analysis
Selected Applications
Efficient Allocation of Scarce Resources
Scheduling Production and Inventory
The Cutting-Stock Problem
Approximating Data by Linear Functions
Matrix Games
Systems of Linear Inequalities
Connections with Geometry
Finding All Vertices of a Polyhedron
Network Flow Problems
The Network Simplex Method
Applications of the Network Simplex Method
Upper-Bounded Transshipment Problems
Maximum Flows Through Networks
The Primal-Dual Method
Advanced Techniques
Updating a Triangular Factorization of the Basis
Generalized Upper Bounding
The Dantzig-Wolfe Decomposition Principle
Appendix: The Ellipsoid Method
Bibliography
Solutions to Selected Problems
Index

×
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.

×