Optimization Techniques in Operation Research
Special features of the book 1. A very comprehensive and accessible approach in the presentation of the material. 2. A variety of solved examples to illustrate the theoretical results. 3. A large number of unsolved exercises for the students are given for practice at the end of each section. 4. Solution to each unsolved examples are given at the end of each exercise.
What people are saying - Write a review
Linear Programming Problem
Duality in Linear Programming
Transportation and Assignment Problems
Integer Linear Programming and Travelling Salesman Problem
artificial variable assignment basic variable Branch and Bound BV x1 x2 column compress constraint convex function convex set critical activities critical path decision variables duration dynamic programming Example F H G feasible solution Find the optimal given Goal Hence ILPP integer Let the LPP machines M1 maximisation Maximize Z maximum method to solve minimisation problem Minimize minimum mixed strategies NLPP node non-basic variable non-negative objective function obtain optimal sequence optimal solution optimal table optimal value optimum player positive semi-definite primal processing programming problem quadratic reduced matrix s2 s3 Solution saddle point simplex method slack variables Solve the following starting BFS step Subject to x1 subproblem surplus variable theorem transportation problem unrestricted in sign write zero