The Simplex Method of Linear Programming
The Simplex Method of Linear Programming is backordered and will ship as soon as it is back in stock.
Couldn't load pickup availability
Genuine Products Guarantee
Genuine Products Guarantee
We guarantee 100% genuine products, and if proven otherwise, we will compensate you with 10 times the product's cost.
Delivery and Shipping
Delivery and Shipping
Products are generally ready for dispatch within 1 day and typically reach you in 3 to 5 days.
The Simplex Method of Linear Programming
Book Details
-
Publisher: Dover
-
Author: F. A. Ficken
-
Language: English
-
ISBN: 9780486796857
-
Pages: 58
-
Cover: Paperback
-
Dimensions: 8.9 x 6.0 x 0.1 inches
About the Book
The Simplex Method for Linear Programming by F. A. Ficken provides a concise yet comprehensive guide to understanding the simplex method, a widely used approach for solving optimization problems in linear programming. Designed with undergraduate students in mind, this book offers a clear, accessible treatment of the subject without requiring a deep background in linear algebra.
The text begins by introducing foundational concepts such as allocation problems, matrix notation for dual problems, feasibility, and duality theorems. The following chapters delve into topics like convex sets, boundedness, optimal points, and the intricacies of the simplex method and its corresponding tableaux. By breaking down complex theories and presenting them in digestible sections, Ficken offers a systematic way of understanding the simplex method and its practical applications.
In addition, two helpful appendices provide supplementary material, further enriching the reader’s understanding of the concepts explored throughout the book. Whether you are new to linear programming or looking to strengthen your grasp of optimization techniques, this work serves as an excellent, student-friendly resource.
