Linear Programming And Network Flows

Review of the book
This book is one of the best published books in the field of linear programming and network flow, prepared by researchers at Georgia Tech University. This book can be presented as a one-semester course, and some of the contents of this book can be omitted. Also, this book can be a reference for a two-semester course entitled linear programming and network flow, which covers all the contents of the book.

Table of Contents
The content presented in this book is as follows:
1. Introduction
2- Results of linear algebra and convex analysis
3- Simplex method
4- Initial solution and convergence
5- Special forms of the simplex method and optimality conditions
6- Duality and sensitivity analysis
7- Principles of analysis
8- Transportation and allocation issues
9- The problem of flow with minimum cost in the network
10- Algorithm out of kilter
11- The most flow problem, the shortest path problem, and the multi-commodity problem