Summary |
This volume is self-contained in the sense that the algebra and mathematics required to comprehend the models presented are also contained in the book. The major focus of the book is on allocation models and their applications.
The book is organized into eight chapters.
Chapter 1 (Mathematical Programming) describes the general nature and characteristics of mathematical programming.
Chapter 2 (Matrices, Vectors, and Linear Systems) introduces the reader to some of the most important concepts of matrix algebra, a prerequisite for grasping the material in the rest of the book
Chapter 3 (Linear Programming) is devoted to a discussion of the general liner-programming model.
Chapter 4 (Extensions of Linear-Programming Methods) presents the revised simplex method and the dual-simplex method.
Chapter 5 (Special Linear-Programming Problems) builds on the foundations laid in earlier chapters.
Chapter 6 (Integer Programming) present the basic structure of integer-programming problems.
Chapter 7 (Nonlinear Programming) treats nonlinear programming at a very elementary level.
Chapter 8 (Dynamic Programming) presents the theory as well as applications of dynamic programming.
|
