Lovely Professional University, Punjab

Course Code Course Title Course Planner Lectures Tutorials Practicals Credits
MEC426 DESIGN AND OPTIMIZATION 16899::Akash Saini 3.0 0.0 0.0 3.0
Course Category Courses with numerical and conceptual focus
TextBooks
Sr No Title Author Edition Year Publisher Name
T-1 OPTIMIZATION FOR
ENGINEERING DESIGN:
ALGORITHMS AND EXAMPLES
KALYANMOY DEB 2nd PHI (PRETICE HALL INDIA)
Reference Books
Sr No Title Author Edition Year Publisher Name
R-1 ENGINEERING OPTIMIZATION:
THEORY AND APPLICATIONS
S.S.RAO 1st NEW AGE INTERNATIONAL (P) LIMITED
R-2 INTRODUCTION TO OPTIMUM
DESIGN
JASBIR S. ARORA 3rd ACADEMIC PRESS
Other Reading
Sr No Journals articles as Compulsary reading (specific articles, complete reference)
OR-1 http://www.google.co.in/url?sa=t&rct=j&q=&esrc=s&source=web&cd=1&cad=rja&uact=8&ved=0CB0QFjAA&url=http%3A%2F%2Fwww.stat.yale.edu
%2F~pollard%2FBooks%2FAsymptopia%2Fold-
Bracketing.pdf&ei=Sf3FU6rJJsOVuAS0uIKIDQ&usg=AFQjCNEE5n80TIWiN39oDgM_vTJZ5GVxOQ&bvm=bv.71126742,d.c2E ,
OR-2 http://www.google.co.in/url?sa=t&rct=j&q=&esrc=s&source=web&cd=1&cad=rja&uact=8&ved=0CCAQFjAA&url=http%3A%2F%2Fweb.iitd.ac.in
%2F~achawla%2Fpublic_html
%2F742%2Fmultvaropt.pdf&ei=rgHGU8nINI6IuATZ2IGoBg&usg=AFQjCNHbQfFe0qz529ewD6yAenpsLD5dHw&bvm=bv.71126742,d.c2E ,
OR-3 http://www.google.co.in/url?sa=t&rct=j&q=&esrc=s&source=web&cd=1&cad=rja&uact=8&ved=0CBsQFjAA&url=http%3A%2F%2Fwww.fq.math.ca
%2FScanned%2F19-4%2Fhassin.pdf&ei=yP7FU8O6GsO2uATJ7oCwDg&usg=AFQjCNFKDRad3NXvzLKUdy-XPSOmUzLLrw&bvm=bv.71126742,d.c2E ,
OR-4 http://www.google.co.in/url?sa=t&rct=j&q=&esrc=s&source=web&cd=2&cad=rja&uact=8&ved=0CCEQFjAB&url=http%3A%2F%2Fmat.gsia.cmu.edu
%2Fclasses%2FQUANT%2FNOTES%2Fchap7.pdf&ei=3ATGU-
GrCoui8AWTuYDICA&usg=AFQjCNELY6CG1Ys867UDhDwHNTQBtGb1Lg&bvm=bv.71126742,d.dGc ,
OR-5 http://www.google.co.in/url?sa=t&rct=j&q=&esrc=s&source=web&cd=1&cad=rja&uact=8&ved=0CBsQFjAA&url=http%3A%2F%2Fnptel.ac.in%2Fcourses
%2FWebcourse-contents%2FIISc-BANG%2FOPTIMIZATION%2520METHODS%2Fpdf
%2FModule_2%2FM2L5_LN.pdf&ei=2gPGU6KbKJeKuAT4t4GoDw&usg=AFQjCNGALiBSTaEJ6VaY2sT5jJFTW6isMg&bvm=bv.71126742,d.c2E ,
OR-6 http://www.google.co.in/url?sa=t&rct=j&q=&esrc=s&source=web&cd=2&cad=rja&uact=8&sqi=2&ved=0CCEQFjAB&url=http%3A%2F%2Fwww.inf.ufpr.br
%2Faurora%2Fdisciplinas%2Ftopicosia2%2Flivros%2Fsearch
%2Finteger.pdf&ei=OgPGU_vIK9CTuASWp4K4Cg&usg=AFQjCNF8wHfo_RuwpTkxij84Zy_2m11Rqg&bvm=bv.71126742,d.c2E ,
LTP week distribution: (LTP Weeks)
Week
Number
Lecture
Number
Broad Topic(Sub Topic) Chapters/Sections of
Text/reference
books
Other Readings,
Relevant Websites,
Audio Visual Aids,
software and Virtual
Labs
Lecture Description Learning Outcomes Pedagogical Tool
Demonstration/
Case Study /
Images /
animation / ppt
etc. Planned
Live Examples
Week 1 Lecture 1 Introduction to optimization
(Optimization problem
formulation)
T-1:1.1 Introduction Student will come to
know about
optimization
Lecture 2 Introduction to optimization
(optimization algorithms)
T-1:1.3 Algorithms To know about
different algorithms
available.
Discussion and
figure of flowchart
of optimal design
process
Lecture 3 Introduction to optimization
(applications and examples)
T-1:1.2 Engineering
Optimization Problems
To get knowledge
about how to make
detail design
Figure of car
suspension system
and
a truss structure.
Introduction to optimization
(different optimization
methods available)
T-1:1.3 Engineering
Optimization Problems
To get knowledge
about how to make
detail design
Figure of car
suspension system
and
a truss structure.
Travelling
Salesman
Problem
Week 2 Lecture 4 Bracketing and Region
elimination method
(Optimization criteria)
T-1:2.1 Local optimality criteria,
global optimal points
To get knowledge
about different one
variable
optimization
techniques
Brainstorming
Lecture 5 Bracketing and Region
elimination method
(Exhaustive search method)
T-1:2.2 OR-1 Exhaustive search
method.
To get knowledge
about how to get
minimum function in
two phases
Figure of
exhaustive
search method
Lecture 6 Bracketing and Region
elimination method
(Exhaustive search method)
T-1:2.2 OR-1 Exhaustive search
method.
To get knowledge
about how to get
minimum function in
two phases
Figure of
exhaustive
search method
Week 3 Lecture 7 Bracketing and Region
elimination method(bound
phase method)
T-1:2.2 OR-1 Bounding Phase Method To get knowledge
about how to get
minimum function in
two phases
Discussion using
White Board
Lecture 8 Bracketing and Region
elimination method(bound
phase method)
T-1:2.2 OR-1 Bounding Phase Method To get knowledge
about how to get
minimum function in
two phases
Discussion using
White Board
Detailed Plan For Lectures
Weeks before MTE 7
Weeks After MTE 7
Spill Over 3
Week 3 Lecture 9 Bracketing and Region
elimination method
(Fibonacci search method)
T-1:2.3 OR-3 Interval Halving Method
and Fibonacci Method
To get knowledge
about region
elimination
method
Figure of region
elimination method
Week 4 Lecture 10 Bracketing and Region
elimination method
(Fibonacci search method)
T-1:2.3 OR-3 Interval Halving Method
and Fibonacci Method
To get knowledge
about region
elimination
method
Figure of region
elimination method
Lecture 11 Bracketing and Region
elimination method(Golden
search method)
T-1:2.3 OR-3 Golden Section
Algorithm
To get knowledge
about region
elimination
method
Figure of region
elimination method
Lecture 12 Bracketing and Region
elimination method(Golden
search method)
T-1:2.3 OR-3 Golden Section
Algorithm
To get knowledge
about region
elimination
method
Figure of region
elimination method
Week 5 Lecture 13 Gradient based method
(Newton Raphson method)
T-1:1.1 1.2 1.3 2.1
2.2 2.3
Spill Over 1 Spill Over 1 Spill Over 1
Lecture 14 Test1
Lecture 15 Gradient based method
(Bisection method)
T-1:2.5 Point estimation
Method, Newton
Raphson Method and
Bisection Method
To get knowledge
about how to improve
the accuracy of the
solution
Discussion using
white board about
the algorithm
Week 6 Lecture 16 Gradient based method
(Bisection method)
T-1:2.5 Point estimation
Method, Newton
Raphson Method and
Bisection Method
To get knowledge
about how to improve
the accuracy of the
solution
Discussion using
white board about
the algorithm
Lecture 17 Gradient based method
(Bisection method)
T-1:2.5 Point estimation
Method, Newton
Raphson Method and
Bisection Method
To get knowledge
about how to improve
the accuracy of the
solution
Discussion using
white board about
the algorithm
Lecture 18 Gradient based method
(Bisection method)
T-1:2.5 Point estimation
Method, Newton
Raphson Method and
Bisection Method
To get knowledge
about how to improve
the accuracy of the
solution
Discussion using
white board about
the algorithm
Week 7 Lecture 19 Gradient based method(Root
finding using optimization
technique)
T-1:2.6 TO know about single
variable gradient based
algorithm
To get knowledge
about how to improve
the accuracy of the
solution
Discussion using
white board about
the algorithm
Lecture 20 Gradient based method(Root
finding using optimization
technique)
T-1:2.6 TO know about single
variable gradient based
algorithm
To get knowledge
about how to improve
the accuracy of the
solution
Discussion using
white board about
the algorithm
Lecture 21 Gradient based method
(Secant Method)
T-1:2.6 TO know about single
variable gradient based
algorithm
To get knowledge
about how to improve
the accuracy of the
solution
Discussion using
white board about
the algorithm
MID-TERM
Week 8 Lecture 22 Multi-objective optimization
(Optimization criteria)
T-1:3.1 Optimality Criteria To get knowledge
about to find
minimum point along
a particular
search directio
Brain Storming Global
Optimization in
the Localization
of Brain
Activity
Lecture 23 Multi-objective optimization
(Evolutionary optimization
method)
T-1:3.3 OR-2 To study about the
evolutionary algorithm
To get knowledge
about number of
minimization
algorithms that use
function value only
Figure of
Himmelblau
method
Multiobjective
optimization
using
evolutionary
algorithms A
comparative
case study
Lecture 24 Multi-objective optimization
(Evolutionary optimization
method)
T-1:3.3 OR-2 To study about the
evolutionary algorithm
To get knowledge
about number of
minimization
algorithms that use
function value only
Figure of
Himmelblau
method
Multiobjective
optimization
using
evolutionary
algorithms A
comparative
case study
Week 9 Lecture 25 Multi-objective optimization
(Hooke- Jeeves Method)
T-1:3.3 OR-2 To study two different
methods
To get knowledge
about number of
minimization
algorithms that use
function value onl
Figure of
Himmelblau
method
Lecture 26 Multi-objective optimization
(Hooke- Jeeves Method)
T-1:3.3 OR-2 To study two different
methods
To get knowledge
about number of
minimization
algorithms that use
function value onl
Figure of
Himmelblau
method
Lecture 27 Multi-objective optimization
(Simplex Method)
T-1:3.3 OR-4 To study its different
method
To get knowledge
about number of
minimization
algorithms that use
function value onl
Figure of
Himmelblau
method
Week 10 Lecture 28 Multi-objective optimization
(Cauchy (Steepest Descent)
Method)
T-1:3.4 4.1
R-1:6.1
OR-5 To know another
gradient based algorithm
and constrained
algorithms
To get knowledge
about number of
minimization
algorithms that use
function value only
and also to minimize
the constrained
function
Figure of
Himmelblau
method
Week 10 Lecture 29 Multi-objective optimization
(Cauchy (Steepest Descent)
Method)
T-1:3.4 4.1
R-1:6.1
OR-5 To know another
gradient based algorithm
and constrained
algorithms
To get knowledge
about number of
minimization
algorithms that use
function value only
and also to minimize
the constrained
function
Figure of
Himmelblau
method
Lecture 30 Multi-objective optimization
(Cauchy (Steepest Descent)
Method)
T-1:3.4 4.1
R-1:6.1
OR-5 To know another
gradient based algorithm
and constrained
algorithms
To get knowledge
about number of
minimization
algorithms that use
function value only
and also to minimize
the constrained
function
Figure of
Himmelblau
method
Week 11 Lecture 31 Test2
Lecture 32 Specialized methods(Integer
programming)
T-1: 4.6 5.1 OR-6 To know about the
constrained and integer
programming
Frank wolfe and
cutting plane
methods will be
discussed along with
integer programming.
Figure of
Himmelblau
method
Lecture 33 Specialized methods(Integer
programming)
T-1: 4.6 5.1 OR-6 To know about the
constrained and integer
programming
Frank wolfe and
cutting plane
methods will be
discussed along with
integer programming.
Figure of
Himmelblau
method
Week 12 Lecture 34 Specialized methods(Integer
programming)
T-1: 4.6 5.1 OR-6 To know about the
constrained and integer
programming
Frank wolfe and
cutting plane
methods will be
discussed along with
integer programming.
Figure of
Himmelblau
method
Lecture 35 Specialized methods(Integer
programming)
T-1: 4.6 5.1 OR-6 To know about the
constrained and integer
programming
Frank wolfe and
cutting plane
methods will be
discussed along with
integer programming.
Figure of
Himmelblau
method
Lecture 36 Specialized methods
(Geometric programming)
T-1:4.1 4.6 5.1 Spill over 2 Spill Over 2 Spill Over 2
Week 13 Lecture 37 Test3
Lecture 38 Specialized methods
(simulated annealing)
T-1:5.1 5.2 6.2 Specialized
programming and
Annealing Method
To study about
integer, geometric
and simulated
annealing method
Discussion using
white board about
the algorithm
Lecture 39 Specialized methods
(simulated annealing)
T-1:5.1 5.2 6.2 Specialized
programming and
Annealing Method
To study about
integer, geometric
and simulated
annealing method
Discussion using
white board about
the algorithm
Week 14 Lecture 40 Genetic algorithms and
evolutionary approaches
(Differences and similarities
between genetic algorithms
and traditional techniques)
T-1:6.1 Genetic Algorithm and
its operator
Knowledge about
genetic Algorithms
and its operator
Discussion using
white board about
the algorithm
Its application in
hydrodynamics
Lecture 41 Genetic algorithms and
evolutionary approaches
(Operators of GA)
T-1:6.1 Newton Raphson
method
To study about the
different operators
Discussion using
white board about
the topics
Optimization of
warranty cost
using genetic
algorithm
Lecture 42 Genetic algorithms and
evolutionary approaches
(Newton Raphson method)
T-1:5.1 5.2 6.1 6.2 Spill Over 3 Spill Over 3 Spill Over 3
SPILL OVER
Week 15 Lecture 43 Spill Over
Lecture 44 Spill Over
Lecture 45 Spill Over
Scheme for CA:
Component Frequency Out Of Each Marks Total Marks
Test 2 3 10 20
Total :- 10 20
Details of Academic Task(s)
AT No. Objective Topic of the Academic Task Nature of Academic Task
(group/individuals/field
work
Evaluation Mode Allottment /
submission Week
Test1 To prepare the
students for MTE
exam
Introduction to Optimum design, Selection of configuration,
Bracketing method, Region-elimination methods
Individual Written Test 4 / 5
Test2 To impart the
knowledge of the
multivariable
algorithm
optimization
Different Multi-variable Algorithms as mentioned in instruction
plan
Individual Written Test 10 / 11
Test3 To impart the
knowledge of the
constarined
optimization
Kuhn-Tucker (KT) conditions, Frank-Wolfe Method, Cutting
Plane Method.
Individual Written Test 12 / 13
List of suggested topics for term paper[at least 15] (Student to spend about 15 hrs on any one specified term paper)
Sr. No. Topic
1 NA