Linear Programming: Foundations and Extensions (International Series in Operations Research and Management Science, 4)
- Book Review,
by Robert J. Vanderbei
Book News, Inc.
A introduction to the subject; the first two sections assume only linear algebra, but the other two require some knowledge of multivariate calculus, particularly the ability to use Lagrange multipliers to solve simple calculus problems in two and three dimensions. Includes source code in C for five of the problems discussed, and answers to some of the exercises. -- Copyright © 1999 Book News, Inc., Portland, OR All rights reserved
Book Description
This book focuses largely on constrained optimization. It begins with a substantial treatment of linear programming and proceeds to convex analysis, network flows, integer programming, quadratic programming, and convex optimization. Along the way, dynamic programming and the linear complementarity problem are touched on as well. This book aims to be the first introduction to the topic. Specific examples and concrete algorithms precede more abstract topics. Nevertheless, topics covered are developed in some depth, a large number of numerical examples worked out in detail, and many recent results are included, most notably interior-point methods. The exercises at the end of each chapter both illustrate the theory, and, in some cases, extend it. Optimization is not merely an intellectual exercise: its purpose is to solve practical problems on a computer. Accordingly, the book comes with software that implements the major algorithms studied. At this point, software for the following four algorithms is available: The two-phase simplex method The primal-dual simplex method The path-following interior-point method The homogeneous self-dual methods.£/LIST£.
Book Info
Focuses largely on constrained optimization. Begins with a substantial treatment of linear programming and proceeds to convex analysis, network flows, integer programming, and convex optimization.
Buy from Amazon
Compare Prices
|
|
Home
