Linear Programs and Related Problems: A Volume in the COMPUTER...

Features

• Cover Type: Hard Cover with 584 pages
• Published by: Academic Press October 12, 1992
• Written in: English
• ISBN 10 Number: 0125154402
• ISBN 13 Number: 978-0125154406
• Book Dimensions: 8.9 x 5.9 x 1.4 inches
• Weighs: 2.1 pounds

Product Description
This text is concerned primarily with the theory of linear and nonlinear programming, and a number of closely-related problems, and with algorithms appropriate to those problems. In the first part of the book, the authors introduce the concept of duality which serves as a unifying concept throughout the book. The simplex algorithm is presented along with modifications and adaptations to problems with special structures. Two alternative algorithms, the ellipsoidal algorithm and Karmarker's algorithm, are also discussed, along with numerical considerations. the second part of the book looks at specific types of problems and methods for their solution. This book is designed as a textbook for mathematical programming courses, and each chapter contains numerous exercises and examples.

Back Cover Copy
This text is concerned with the theory of linear and nonlinear programming, related problems, and the algorithms appropriate to the problems. The concept of duality is introduced early and serves as a unifying theme throughout the book. It is used to provide insight, interpret results, and provide practical information.

In this book the maximization problem and its dual minimization problem are considered together, and solving either problem automatically provides a solution to the other. The related topics in matrix games, assignment problems, transportation problems, network-flow problems, and transshipment problems are also treated simultaneously with their dual problems.

The tableaux are used as graphical tools to assist the reader in determining what the next step should be, whether the problem is feasible, whether it has an optimal solution, and , if it does, solutions to both of the dual problems at the same time.

The answer set is extensive. It includes the correct result for all of the problems in the text and, for many problems, a thorough explanation of how to arrive at that result. There is also an IBM compatible disk accompanying the text that includes programs for doing the arithmetic work associated with pivoting in tableaux and the Hungarian algorithm. The data files for the appropriate exercises are included, and new data can be entered and saved. User-selected results may be printed