Special sub-classes of LP used to minimize logistics costs and optimize resource allocation.
| Chapter | Title | Description | | :--- | :--- | :--- | | 1 | | An introduction to the field of optimization. | | 2 | Mathematical Preliminaries | A recap of essential mathematical concepts needed to understand the rest of the book, including convexity theory. | | 3 | Simplex Method | A detailed explanation of the core algorithm for solving linear programming problems. | | 4 | Duality | Explores the concept of duality in linear programming, where every problem has a related "dual" problem. | | 5 | Dual Simplex Method | Describes a related method for solving linear programs, useful in certain scenarios. | | 6 | Revised Simplex Method | Provides a more computationally efficient version of the simplex method. | | 7 | Integer Programming | Covers problems where decision variables are restricted to integers. | | 8 | Sensitivity Analysis | Studies how changes in the problem's parameters affect the optimal solution. | | 9 | Transportation Problems | Addresses the classic problem of finding the most efficient way to transport goods from multiple sources to multiple destinations. | | 10 | Assignment Problems | Deals with optimally assigning tasks to agents. | | 11 | Theory of Games | The final chapter applies the concepts learned to analyze strategic interactions between rational decision-makers, such as zero-sum games and finding optimal strategies. | | Appendix | | Includes topics like general mathematical programming and some advanced topics. | Linear Programming And Game Theory Ghosh Chakraborty Pdf
: The rewards or utilities resulting from the intersection of player choices. Two-Person Zero-Sum Games Special sub-classes of LP used to minimize logistics
Companies use LP to find the cheapest way to ship goods from multiple warehouses to various retail stores. | | 3 | Simplex Method | A
