Key Features A very comprehensive and accessible approach in the presentation of the material. A variety of solved examples to illustrate the theoretical results. A large number of unsolved exercises for practice at the end of each section. Solutions to all unsolved examples are given at the end of each exercise. About the Book: Optimization Techniques in Operation Research This book meets the requirements of Engineering/Science and Management students at graduate and postgraduate level. Main topics discussed in the book are Linear Programming including duality and sensitivity analysis. Non-linear programming including quadratic and separable programming. Transport and assignment problem. Game theory. Integer programming including Traveling Salesman problem. Goal programming including multi-objective programming. Network analysis (CPM and PERT). Sequencing problem. Dynamic programming. New in this Edition Two new chapters, viz., "Introduction to Optimization", "Classical Optimization Techniques", some more solved, unsolved examples and a new article on processing 2-jobs through k-machines in Chapter 13, have been added in the present edition. Contents Introduction to Optimization Linear Programming Problem Duality in Linear Programming Sensitivity Analysis Transportation and Assignment Problems Integer Linear Programming and Travelling Salesman Problem Dynamic Programming Game Theory Classical Optimization Techniques Non-Linear Programming Networking Linear Goal Programming Sequencing Index. About the Author: C. B. Gupta C.B. Gupta, is Professor of Mathematics at Birla Institute of Technology and Science, Pilani. He did his M.Sc. in Mathematical Statistics and Ph. D. in Operations Research from Kurukshetra University, Kurukshetra. His field of specialization are Applied Statistics and Operations Research, he has published a large number of research papers on these topics in peer reviewed international and national journals. He has more than 20 years of teaching e