Introductory Operation ResearchThis book on Operation Research has been specially written to meet the requirements of the M.Sc., M.Com and M.B.A. students. The subject matter has been discussed in such a simple way that the students will find no difficulty to understand it. The proof of various theorems and examples has been given with minute details. Each chapter of this book contains complete theory and fairly large number of solved examples, sufficient problems have also been selected from various universities examination papers. Contents: Introduction to Operation Research, Integer Programming, Dual Problem, Goal Programming, Sequencing Problem. |
Contents
Introduction to Operation Research | 1 |
Integer Programming | 47 |
Programming Problem Gomorys all Integer Cutting Plane | 56 |
Dual Problem | 99 |
Goal Programming | 219 |
Sequencing Problem | 251 |
Common terms and phrases
A₁ A₂ achieved algorithm application assignment problem b₁ b₂ basic variables Branch and Bound C₂ CB WB coefficients constraints corresponding cost cutting plane decision problem decision variables decision-maker deviational variables dual problem dual variables equation Example finite optimal solution Formulate and solve given L.P.P. given problem goal programming Gomory's idle incoming vector inequalities integer linear programming integer programming problem integer solution integer values linear programming problem machine mathematical model matrix maximization maximum Mini minimize the total minimum elapsed non-integer non-negative objective function obtained operation research operation research models optimal sequence optimum overtime primal problem priority processing production sequencing problem simplex method slack variable standard primal form Step surplus variables Table C₁ Theorem total elapsed unbounded solution unrestricted in sign W₁ W₂ Write the dual written as Max X₁ X₂ Y₁ Y₂ Z₁ zero ין