About the book
This concise but detailed and thorough treatment discusses the rudiments of the well-known simplex method for solving optimization problems in linear programming. Geared toward undergraduate students, the approach offers sufficient material for readers without a strong background in linear algebra. Many different kinds of problems further enrich the presentation.
The text begins with examinations of the allocation problem, matrix notation for dual problems, feasibility, and theorems on duality and existence. Subsequent chapters address convex sets and boundedness, the prepared problem and boundedness and consistency, optimal points and motivation of the simplex method, and the simplex method and tableaux. The treatment concludes with explorations of the effectiveness of the simplex method and the solution of the dual problem. Two helpful Appendixes offer supplementary material.
Editions of Simplex Method of Linear Programming
- Paperback
- ISBN 9780486796857
- EBook
- ISBN 9780486804729
Read an Excerpt
This concise but detailed and thorough treatment discusses the rudiments of the well-known simplex method for solving optimization problems in linear programming. Geared toward undergraduate students, the approach offers sufficient material for readers without a strong background in linear algebra. Many different kinds of problems further enrich the presentation.
The text begins with examinations of the allocation problem, matrix notation for dual problems, feasibility, and theorems on duality and existence. Subsequent chapters address convex sets and boundedness, the prepared problem and boundedness and consistency, optimal points and motivation of the simplex method, and the simplex method and tableaux. The treatment concludes with explorations of the effectiveness of the simplex method and the solution of the dual problem. Two helpful Appendixes offer supplementary material.
Frequently Asked Questions
What is Simplex Method of Linear Programming about?
This concise but detailed and thorough treatment discusses the rudiments of the well-known simplex method for solving optimization problems in linear programming. Geared toward undergraduate students, the approach offers sufficient material for readers without a strong background in linear algebra. Many different kinds of problems further enrich the presentation.
The text begins with examinations of the allocation problem, matrix notation for dual problems, feasibility, and theorems on duality and existence. Subsequent chapters address convex sets and boundedness, the prepared problem and boundedness and consistency, optimal points and motivation of the simplex method, and the simplex method and tableaux. The treatment concludes with explorations of the effectiveness of the simplex method and the solution of the dual problem. Two helpful Appendixes offer supplementary material.
What core themes, tropes, or subjects are explored in Simplex Method of Linear Programming?
Mathematics and Science > Mathematics > Optimization > Linear programming
Where can I read a sample of Simplex Method of Linear Programming?
You can read an official preview of the few pages here https://www.book2look.com/book/9780486796857
Is Simplex Method of Linear Programming part of a series, and can it be read as a standalone?
Yes it is a part of series Dover Books on Mathematics
Who is/are the Author/s of the book Simplex Method of Linear Programming?
F.A. Ficken
What are the ISBN numbers for the physical and digital editions?
Simplex Method of Linear Programming is available as paperback(ISBN 9780486796857) and ebook(ISBN 9780486804729)
Where can I buy Simplex Method of Linear Programming online or support local independent bookshops?
You can buy Simplex Method of Linear Programming from below
Where can I buy Simplex Method of Linear Programming?