R23
MECH · 4-1
✓ VERIFIED VS. PUBLISHED SYLLABUS 2026-07-12
Operations Research
JNTUK R23 · MECH · semester 4-1 · syllabus
This JNTUK R23 humanities and management course is listed for Mechanical Engineering (MECH). It is listed in semester 4-1. It carries 2 credits. The published coverage runs across 5 units, from Unit I through Dynamic Programming.
Verified vs. published syllabus
Checked 12 Jul 2026
SOURCE DOCKET
Published evidence
✓ Verified
Checked 12 Jul 2026
Record 5 published units
Verification scope The course structure, credits, and unit-wise syllabus are sourced directly from JNTUK's official R23 Mechanical Engineering course structure and syllabus.
5 units, from Unit I to Dynamic Programming. Tick off units as you cover them — your progress stays on this device.
Unit-wise syllabus
0 / 5 COVERED
UNIT 01 — Unit I
INTRODUCTION - definition– characteristics and phases – types of operation research models – applications. LINEAR PROGRAMMING: Linear programming problem formulation – graphical solution – simplex method – artificial variables techniques -two– phase method, big-M method – duality principle.
UNIT 02 — Transportation Problem
Formulation – optimal solution, unbalanced transportation problem – degeneracy, assignment problem – formulation – optimal solution - variants of assignment problem- travelling salesman problem. SEQUENCING – Introduction – flow –shop sequencing – n jobs through two machines – n jobs through three machines – job shop sequencing – two jobs through ‘m’ machines.
UNIT 03 — 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. THEORY OF GAMES: Introduction – mini. max (max. mini) – criterion and optimal strategy – solution of games with saddle points – rectangular games without saddle points – 2 x 2 games – dominance principle – m x 2 & 2 x n games -graphical method.
UNIT 04 — Queueing Theory
Introduction – single channel – poison arrivals – exponential service times – with infinite population and finite population models– multichannel – poison arrivals – exponential service times with infinite population single channel. INVENTORY CONTROL : Introduction – single item – deterministic models – purchase inventory models with one price break and multiple price breaks – shortages are not allowed – stochastic models – demand may be discrete variable or continuous variable, Instantaneous demand and continuous demand and no set up cost. ABC & VED Analysis.
UNIT 05 — Dynamic Programming
Introduction – Bellman’s principle of optimality – shortest path problem. SIMULATION: Definition – types of simulation models – phases of simulation– applications of simulation – inventory problems