Linear and Nonlinear Programming

Review of the book
This book seeks to cover applied optimization methods. This book is designed in such a way that it can be used as a self-study or as a textbook for undergraduate or graduate students. To read this book, the reader is expected to be familiar with linear algebra.

Table of Contents
The topics covered in this book are as follows:
1. Introduction
2- Basic characteristics of linear programming
3- Simplex method
4- Theory of consanguinity
5- Midpoint methods
6- Flow issues in the network and transportation
7- Basic characteristics of solution methods
8- Descending solution methods
9- Newton’s method
10- Limited minimization conditions
11- primal methods
12- Penalty and barrier methods
13- The methods of cutting and conjugation
14- Dual prime methods