Linear programming/ G. Hadley

Includes Index.

Mathematical Background -- Theory of the simplex method -- Detailed development and computational aspects of the simplex method -- Further discussion of the simplex method -- Resolution of the degeneracy problem -- The revised simplex method -- Duality theory and its ramifications -- Transportation problems -- Network flows -- Special topics -- Applications of linear programming to industrial problems -- Applications of linear programming to economic theory

Chapter 1 introduces the general linear programming problem and exhibits a series of graphical examples. Chapter 2 covers the mathematical background needed. In chapter 3 the fundamental theoretical results required for the simplex method are derived. Chapter 4 provides a detailed development of the computational procedure of the simplex method. The two phase techniques is introduced in Chapter 5, which also introduces a discussion of the solution and requirement spaces. Chapter 6 represens Charnes pertubation techniques and the generalized simplex method for resolving the degeneracy program.
the simplex method is covered in chapter 7. Chapter 8 is devoted duality; included in this chapter are the dual simplex algorithm and the prime- dual algorithm. The solution of transportation problems is mentioned in chapter 9.
Chapter 10 discusses network flow problems, the primal- dual algorithm for transportation problems, assignment problems, and the transshipment problem. Chapter 11 treats a number of spatial topics, such as sensitivity analysis, treatment of upper bounds for the general linear programming problem. The application of linear programming to practical problems in industry is discussed in chapter 12, and applications to economic theory are considered in chapter 13.