Syllabus Optimization Techniques - (CCS357) UNIT I LINEAR MODELS Introduction of Operations Research - mathematical formulation of LPP - Graphical Methods to solve LPP - Simplex Method - Two-Phase method. (Chapter - 1) UNIT II INTEGER PROGRAMMING AND TRANSPORTATION PROBLEMS Integer programming : Branch and bound method - Transportation and Assignment problems - Traveling salesman problem. (Chapter - 2) UNIT III PROJECT SCHEDULING Project network - Diagram representation - Floats - Critical path method (CPM) - PERT - Cost considerations in PERT and CPM. (Chapter - 3) UNIT IV CLASSICAL OPTIMIZATION THEORY Unconstrained problems - necessary and sufficient conditions - Newton-Raphson method, Constrained problems - equality constraints - inequality constraints - Kuhn - Tucker conditions. (Chapter - 4) UNIT V QUEUING MODELS Introduction, Queuing Theory, Operating characteristics of a Queuing system, Constituents of a Queuing system, Service facility, Queue discipline, Single channel models, multiple service channels. (Chapter - 5)
