R23
MECH · 4-1
✓ VERIFIED VS. PUBLISHED SYLLABUS 2026-07-12
Optimization Techniques
JNTUK R23 · MECH · semester 4-1 · syllabus
This JNTUK R23 open elective is listed for Mechanical Engineering (MECH). It is listed in semester 4-1. It carries 3 credits. The published coverage runs across 5 units, from Introduction To Optimization through Unit V.
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 Introduction To Optimization to Unit V. Tick off units as you cover them — your progress stays on this device.
Unit-wise syllabus
0 / 5 COVERED
UNIT 01 — Introduction To Optimization
Engineering applications of optimization- statement of an optimization problem- classification of optimization problem- optimization techniques. CLASSICAL OPTIMIZATION TECHNIQUES: Single variable optimization- multivariable optimization with equality constraints- multivariable optimization with inequality constraints.
UNIT 02 — Unconstrained Optimization Techniques
Pattern search method- Rosenbrock's method of rotating coordinates- Simplex method- Descent methods- Gradient of function- Steepest Descent method.
UNIT 03 — Constrained Optimization Techniques
Characteristics of constrained problem methods of feasible directions - basic approach in the penalty function method- interior penalty function method- convex programming problem- exterior penalty function method.
UNIT 04 — Unit IV
GEOMETRIC PROGRAMMING (G.P): Solution of an unconstrained geometric programming, differential calculus method and arithmetic method. primal dual relationship and sufficiency conditions. Solution of a constrained geometric programming problem (G.P.P). Complimentary geometric programming (C.G.P)
UNIT 05 — Unit V
INTEGER PROGRAMMING (I.P): Graphical representation. Gomory's cutting plane method. Algorithm for zero-one programming problem. Integer non-linear programming.