![The Simplex Method of Linear Programming](https://img.perlego.com/book-covers/109936/9780486804729_300_450.webp)
The Simplex Method of Linear Programming
F.A. Ficken
- 64 pages
- English
- ePUB (mobile friendly)
- Available on iOS & Android
The Simplex Method of Linear Programming
F.A. Ficken
About This 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.
Frequently asked questions
Information
Table of contents
- Cover
- Title Page
- Copyright Page
- Contents
- Preface
- Introduction
- 1. The Allocation Problem; Duality
- 2. Matrix Notation for Dual Problems
- 3. Feasibility; Theorems on Duality and Existence
- 4. Convex Sets; Boundedness
- 5. The Prepared Problem; Boundedness and Consistency
- 6. Optimal Points; Motivation of the Simplex Method
- 7. The Simplex Method; Tableaux
- 8. Effectiveness of the Simplex Method
- 9. Solution of the Dual Problem
- Bibliography
- Appendix I
- Appendix II. Theorems on Existence and Duality