Syllabus
|
Course Code: ST-303 & ST-304 Course Name: (i) Optimization Techniques |
||
| MODULE NO / UNIT | COURSE SYLLABUS CONTENTS OF MODULE | NOTES |
|---|---|---|
| 1 | Artificial and unrestricted Variables, Two phase method, Big M-method, degeneracy and breaking the ties, Charne's perturbation method, revised Simplex method, Duality theory : Formulation and solution of dual problems, dual simplex algorithm and primal dual algorithm. | |
| 2 | Non-Liner Programming Problems (NLPP): formulation of NLPP. Kuhn-Tucker Necessary and Sufficient Conditions of Optimality and Saddle Points. Integer Programming Problems(IPP), formulation of IPP, Solution of IPP: Gomory's algorithm for all integer programming problems, Branch and Bound Algorithm. | |
| 3 | Quadratic Programming : Wolfe’s and Beale’s Method of Solutions. Separable Programming and its Reduction to LPP.Separable Programming Algorithm. Geometric Programming: Constrained and Unconstrained. Complementary Geometric Programming Problems.Fractional programming Algorithm and its computational procedure. | |
| 4 | Dynamic Programming: Principle of optimality , Cargo Loading problem, Inventory Problem, Computational Technique , Dimensionality Problem , Approximation by piecewise linear functions, Optimal path Problem, Sequencing Problem, Control Problem, Optimal page allocation Problem , Serial Multi Stage system , Comparison of Linear & Dynamic Programming. | |
