Operation Research for JNTU-H 18 Course (III - I - MECH. - ME506PC) (Decode)

Rs. 210.00
Tax included. Shipping calculated at checkout.

UNIT-1 Development-definition-characteristics and phases-Types of models-Operations Research models applications. Allocation : Linear Programming Problem Formulation-Graphical solution - Simplex method-Artificial variable techniques : Two-phase method, Big-M method. (Chapters - 1, 2) UNIT-11 Transportation problem : Formulation-Optimal solution, unbalanced transportation problem- Degeneracy. Assignment problem : Formulation-Optimal solution, - Variants of Assignment problem- Travelling salesman problem. (Chapters - 3, 4) UNIT-111 Sequencing : Introduction-Flow-Shop sequencing - η jobs through two machines - η jobs through three machines- Job shop sequencing-twojobs through 'm' machines Replacement : Introduction- Replacement of items that deteriorate with time- when money value is not counted and counted- Replacement of items that fail completely- Group Replacement. (Chapters - 5, 6) UNIT-IV Theory of Games : Introduction- Terminology - Solution of games with saddle points and without saddle points. 2  2 games- dominance principle- m  2 and 2  η games - Graphical method. lnventory : Introduction- Single item, Deterministic models - purchase inventory models with one price break and multiple price breaks- Stochastic models _ Demand may be discrete variable or continuous variable- single period model and no setup cost. (Chapters - 7, 8) UNIT- V Waiting lines : Introduction- Terminology- Single channel- Poisson arrivals and Exponential service times with infinite population. Dynamic Programming : Introduction- Terminology, Bellman's principle of optimality- Applications of Dynamic programming- shortest path problem- linear programming problem. (Chapters - 9, 10)

Pickup available at Nashik Warehouse

Usually ready in 24 hours

Check availability at other stores
Author: [Anup Goel, Ruchi Agarwal] Pages: 252 Edition: 2021 Vendors: Technical Publications