Mathematical Programming Theory and Methods

Review of the book
This book is the result of several years of teaching mathematical programming by the author of this book at the University of Delhi. In preparing this book, efforts have been made to make this book suitable for both self-study and as a reference for researchers. This book consists of three parts. In the first part, basic and preliminary topics about mathematical programming are taught. In the second part, the linear programming from the base to the latest developments is given. In the third part, we talk about dynamic programming and non-linear programming.

Table of Contents
The topics covered in this book are as follows:
1. Introduction
2- Theory of sets and functions
3- Vector spaces
4- Matrix and calculation of determinants
5- Rank and linear combinations
6- Eigen value calculation
7- Systems of linear equations and linear inequalities
8- Convex cone and convex set
9- Convex and concave function
10- Linear programming problems
11- Theory and calculations of simplex method
12- Simplex method
13- Degenercy in linear programming
14- modified simplex method
15- Congenitality in linear programming
16- types of simplex method
17- Sensitivity analysis and analyzes after finding the optimal solution
18- Problems with bounded variables
19- Transportation issues
20- Allocation issues
21- Decomposition principles for linear programming
22- polynomial solutions for linear programming
23- Non-linear programming
24- Second degree planning
25- non-linear programming solution methods
26- duality in non-linear programming
27- Uncertainty planning
28- Special modes of mathematical programming
29- Dynamic planning