Linear Programming: Theory and Computations

For quite a long time students have been using Linear Programming models without understanding the details of the theory. This book reviews the theory and solution method of Linear Programming. These methods include: The Graphical, Simplex, Revised Simplex, Dual Simplex, Karmarker's algorithm, Decomposition, Bounded Variable Technique, and the Column Generation method. All the algorithms involved in the application of the methods mentioned above have systematically been given. All steps to be followed in the formulation of Linear Programming models have been explained. Users of this book will, therefore, be provided with easy to understand and logical review of essential of Linear Programming theory with illustations. This book will be of great benefit to Mathematics students in general and especially students of linear optimization

Autorentext

Bismark Ameyaw holds BSC. Mathematics and Statistics degree from University of Cape Coast and MSC. Industrial Mathematics degree from Kwame Nkrumah University of Science and Technology, Ghana. Kwaku Darkwah holds BSC. Physics and MSC. Mathematics degrees from Kwame Nkrumah University of Science and Technology, Ghana