GANPAT UNIVERSITY

FACULTY OF ENGINEERING& TECHNOLOGY

Programme Bachelor of Technology Branch/Spec. Mechanical Engineering
Semester VI Version 2.0.0.0
Effective from Academic Year 2020-21 Effective for the batch Admitted in July 2018
Subject code 2ME61PE2 Subject Name Optimization (Elective-II)
Teaching scheme Examination scheme (Marks)
(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total
L TU P TW
Credit 3 0 1 0 4 Theory 40 60 100
Hours 3 0 2 0 5 Practical 30 20 50
Pre-requisites:
Engineering Mathematics
Objectives of Course:
1. To understand the classical optimization techniques for getting solutions to mechanical engineering related
problems.
2. To understand the various numerical methods for getting solutions of constrained and unconstrained problems
of mechanical engineering.
3. To develop the skills for the formulation of mathematical models and application of software tools such as
MATLAB for designing a system operating within a realistic constraints.
Theory syllabus
Unit Content Hrs
1 Introduction to Optimization Techniques: 8
Statement of an Optimization problem – design vector – design constraints – constraint surface –
objective function –objective function surfaces – classification of Optimization problems,
Graphical Method.
2 Classical Optimization Techniques: 8
Single variable Optimization – multi variable Optimization without constraints – necessary and
sufficient conditions for minimum/maximum – multivariable, Optimization with equality
constraints. Solution by method of Lagrange multipliers – multivariable Optimization with
inequality constraints. Kuhn-Tucker Conditions, Constraint Qualification.
3 Unconstrained Optimization Techniques: 12
Introduction; Standard form of the problem and basic terminology; Direct search method- Simplex
method, Random search method, Univariate and pattern search method, Indirect search method-
Steepest Descent (Cauchy) method, Conjugate gradient method, Newton’s method, Application to
engineering problems.
4 Constrained Optimization: 12
Introduction; Standard form of the problem and basic terminology; Direct method; Linear
Programming (Simplex) ; Sequential Linear Programming; Generalized reduced gradient method,
Methods of feasible direction Indirect method: Penalty function method, Interior and exterior
penalty function method, Convex programming problem, Check for Convergence.
5 Application to engineering problems Introduction to non-traditional methods, Genetic Algorithm: 5
Introduction, Representation of design variables, Objective function and constraints, Genetic
operators and numerical results. Introduction to Neural network based optimization.
Practical content
The term work shall be based on analytical work on topics mentioned above
Text Books
 1 S. S. Rao, “Engineering Optimization (Theory and Practice)”, John Wiley & Sons
Reference Books
1 Arora, Jasbir S. , “Introduction to Optimum Design”, Elsevier Academic Press
2 Deb, K., “Optimization for Engineering Design-Algorithms and Examples”, PHI Learning Private Limited,
New Delhi Course
ICT/MOOCs references
1 https://nptel.ac.in/courses/112105235/
Course Outcome:
CO1 Apply knowledge of classical optimization techniques to solve the problems of mechanical systems.
CO2 Apply knowledge of numerical methods for solving the constrained and unconstrained problems of
mechanical engineering.
CO3 Students will be able formulate the mathematical model for a system operating under some constraints and
be able to write own codes in MATLAB for the optimization of the system response.
Mapping of CO and PO:
COs PO -1 PO -2 PO -3 PO -4 PO -5 PO -6 PO -7 PO -8 PO -9 PO -10 PO -11 PO -12
CO1 1 3 0 1 2 0 0 1 0 0 1 0
CO2 2 3 1 0 0 0 0 1 1 0 0 0
CO3 3 2 3 2 0 1 0 0 0 1 0 0