Exploring Interior-Point Linear Programming Algorithms and Software

Name: Exploring Interior-Point Linear Programming Algorithms and Software
Price: 17.25 USD
Availability: InStock
ISBN: 9780262510738

ISBN-10: 0262510731

ISBN-13: 9780262510738

Edition: 1993

Authors: Ami Arbel

List price: $45.00

30 day, 100% satisfaction guarantee!

Marketplace

1 new & used from $17.25

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

Description:

Linear programming is widely used in industry to solve complex planning and resource allocation problems. This book provides practitioners as well as students of this general methodology with an easily accessible introduction to the new class of algorithms known as interior-point methods for linear programming. In addition to presenting the theoretical and algorithmic background necessary for dealing with specific interior-point linear programming algorithms, it offers a review of modeling linear programming problems, a review of the simplex algorithm that has been used to solve linear programming problems in the past, and a complete user's guide to the software that is included with the…

Book details

List price: $45.00
Copyright year: 1993
Publisher: MIT Press
Publication date: 11/10/1993
Binding: Paperback
Pages: 248
Size: 7.25" wide x 9.25" long x 0.75" tall
Weight: 1.100
Language: English

Ami Arbel is Professor in the Department of Industrial Engineering at Tel AvivUniversity.



Series Foreword


Preface


List of Notations


Up and Running



Introduction



Modeling Linear Optimization Problems



The Simplex Algorithm



A First Look at an Interior-Point Algorithm



The Primal Algorithm



The Dual Algorithm



The Primal-Dual Algorithm



Implementation Issues



The Integrated Environment



Command-Line Operations


Appendix A: The MPS File Format


Appendix B: The Netlib Test Collection


Selected Bibliography


Index