Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Linear Programming: Foundations and Extensions

Linear Programming: Foundations and Extensions

Vanderbei, Robert J.

Hardcover

Series: International Operations Research & Management Science, Book 4

General Mathematics

ISBN10: 0792398041
ISBN13: 9780792398042
Publisher: Springer Nature
Published: Dec 31 1996
Pages: 418
Weight: 1.83
Height: 1.15 Width: 6.44 Depth: 9.60
Language: English
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 .

    • 1 different editions

    Also available

    Also in

    General Mathematics

    View All