0% found this document useful (0 votes)
20 views

PE 6222 Optimization for Engineering Design

The document is a course syllabus for 'Optimization for Engineering Design' (PE 6222) taught by Dr. Solomon Seid, covering various optimization techniques applicable to engineering problems. It outlines course objectives, learning outcomes, instructional methods, a detailed course outline, assessment criteria, and academic integrity policies. The course aims to equip students with comprehensive knowledge and practical skills in optimization methods, culminating in a mini project and examinations.

Uploaded by

Yonas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
20 views

PE 6222 Optimization for Engineering Design

The document is a course syllabus for 'Optimization for Engineering Design' (PE 6222) taught by Dr. Solomon Seid, covering various optimization techniques applicable to engineering problems. It outlines course objectives, learning outcomes, instructional methods, a detailed course outline, assessment criteria, and academic integrity policies. The course aims to equip students with comprehensive knowledge and practical skills in optimization methods, culminating in a mini project and examinations.

Uploaded by

Yonas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

DEFENCE UNIVERSITY

COLLEGE OF ENGINEERING
DEPARTMENT OF PRODUCTION ENGINEERING
Course Syllabus

1. Instructor Information
Name Dr. Solomon Seid
Office Location --
Phone Number +251911899559
E-mail [email protected]
Office Hours --
2. Course Information
Course Name Optimization for Engineering Design
Course Code PE 6222
Credit hours 3-3-0
3. Course Description
Aim: To understand the basic optimization techniques and apply them to engineering problems.
Description: Introduction to Engineering optimization; Classical Optimization Techniques; Non
linear Programming; Interpolation Methods; Unconstrained Optimization Techniques; Descent
Methods; Constrained Optimization Techniques; Dynamic Programming; Genetic Algorithm (GA),
Design of GA, Key concepts of GA.
4. Method of Instruction
Class lectures 3 (Fifty minutes lecture hours every week)
 Active learning (involves full participation of students)
In-class Tutorial Nil
Study of lecture notes  This is fully students’ responsibility.
Lab Nil
5. Learning Outcomes
After the completion of the course the student will have the following attributes:
5.1 Comprehensive Knowledge
5.1.1 Describe the overall optimal design processes in designing systems and know how to translate
a descriptive statement of the design problem into mathematical statement for optimization.
5.1.2 Understand classical optimization techniques and their applications.
5.1.3 Identify non – linear programming problems and apply optimization methods to solve them.
5.1.4 Differentiate unconstrained problems and apply unconstrained optimization techniques to
solve them.
5.1.5 Know how to apply descent methods to optimization problems.
5.1.6 Differentiate constrained problems and apply constrained optimization techniques to solve
them.
5.1.7 Know Dynamic Programming and how to apply it to solve optimization problems.
5.1.8 Identify basic concepts and applications of genetic algorithm
5.2 Intellectual and practical skills
5.2.1 Present design optimization calculations in a professional, neat, and orderly manner that can
be understood and evaluated by others knowledgeable in the field of design.

1
5.2.2 Will be well versed in engineering design optimization techniques.

5.2.3 Develop design problem solving ability.

5.3 Attitude and behavior


 Appreciate the application of optimization techniques in design engineering.
6. Course Outline
Chapter Week Topics to be covered Learning Assignments/activity
(Lecture hours) Outcomes

Chapter: 1 1  Orientation of Syllabus 5.1.1 Students will attend to


 Introduction 5.2.1 the lecture on the
Introduction to  Engineering Application of 5.2.2 mentioned topics.
Engineering Optimization Optimization 5.2.3
 Multivariable Optimization 5.3
 Statement of Optimization
Problem
 Design Vector
 Design Constraints
 Objective Function
 Classification of Optimization
Chapter: 2 2  Problems
Introduction Students will attend to
 Single Variable Optimization, the lecture on the
Classical Optimization with Equality Constraints 5.1.2 mentioned topics.
Technique  Solution by Direct 5.2.1
Substitution 5.2.2
 Solution by the Method of 5.2.3
3  Constrained Variation
Solution by the Method of 5.3 Students will attend to
Lagrange Multipliers the lecture on the
 Multivariable Optimization mentioned topics.
with Inequality Constraints
 Kuhn-Tucker Condition
Chapter: 3 4  Introduction Students will attend to
 One Dimensional 5.1.3 the lecture on the
Non-linear Programming Minimization Method 5.2.1 mentioned topics.
 Numerical Method 5.2.2
5  Uni-modal Function 5.2.3 Students will attend to
 Unrestricted Search 5.3 the lecture on the
 Exhaustive Search mentioned topics.
6  Dichotomous Search Students will attend to
 Fibonacci and Golden Section the lecture on the
Method mentioned topics.
Chapter: 4 7  Introduction 5.1.4 Students will attend to
 Quadratic and Cubic 5.2.1 the lecture on the
Interpolation Method and Nonlinear Programming 5.2.2 mentioned topics.
Unconstrained 8  Univariate Method 5.2.3 Students will attend to
Optimization Techniques  Powels Method 5.3 the lecture on the
 Simplex Method mentioned topics and
Mini project will be
provided

2
9 Mid Semester Examination Period

Chapter: 5 10  Introduction 5.1.5 Students will attend to


 Steepest Descent 5.2.1 the lecture on the
Descent Methods 5.2.2 mentioned topics.
11  Conjugate Gradient 5.2.3 Students will attend to
 Variable Metric Method 5.3 the lecture on the
mentioned topics.
Chapter: 6 12  Introduction 5.1.6 Students will attend to
 Characteristic of a 5.2.1 the lecture on the
Constrained Optimization Constrained Problem 5.2.2 mentioned topics.
Techniques  Direct Methods 5.2.3
 Random Search Methods 5.3
 Complex Method
13  Indirect Methods Students will attend to
 Convex Programming the lecture on the
Problem mentioned topics.
 Augmented Lagrange
Multiplier Method
Chapter: 7 14  Introduction 5.1.7 Students will attend to
 Multistage Decision 5.2.1 the lecture on the
Dynamic Programming Processes 5.2.2 mentioned topics.
 Concept of Sub 5.2.3
optimization and Principle 5.3
of Optimality

15  Computational Procedure Students will attend to
in Dynamic Programming the lecture on the
mentioned topics.
Chapter: 8 16  Introduction 5.1.8 Presentation and
 Basic Concepts and 5.2.1 Submission of mini
Genetic Algorithm Definitions 5.2.2 project
 Representation of Design 5.2.3
Variables 5.3
 Representation of Objective
Function and Constraints
17  Genetic Operators Students will attend to
 Algorithm the lecture on the
mentioned topics.
18 &19 Semester End Examination
7. Laboratory Activities
8. Required Text and Reference
Text Book 1. S.S. Rao, “Engineering Optimization: Theory and Application”, 3rd Ed.,
Willey Eastern, 2009.
2. R.L Fox, “Optimization methods for Engineering Design”, Addison
Wesley, 1971.
Reference Books 1. John Gaylord Rau, “Optimization and Probability in Systems
Engineering”, Van Nostrand Reinhold, 1984.
2. A. Ravindran, K. M. Ragsdell, and G. V. Reklaitis, “Engineering
Optimization: methods and applications”, 2nd Ed., Wiley, 2006.
3
3. Lam Thu Bui and Sameer Alam, “Multi-Objective Optimization in
Computational Intelligence: Theory and Practice”, 1st Ed., IGI Global,
2008.
4. Richard E. Gustavson, “Production Systems Engineering: Cost and
Performance Optimization”, 1st Ed., McGraw-Hill, 2010.
5. Kalyanmoy Deb, “Optimization for Engineering Design: Algorithms
and Examples”, Prentice-Hall of India Pvt. Ltd, 2004.
Software Required
9. Assessment
Type Weight Due date Behavior and Criteria
th
Mid semester Exam. 30% 9 week of the semester Examination will be set to address learning
outcomes 5.1.1 to 5.1.4, 5.2.1 to 5.2.3, and
5.3
Final semester Exam. 50% 18th or 19th week of the Examination will be set to address learning
semester outcomes 5.1.1 to 5.1.8, 5.2.1 to 5.2.3, and
5.3
Mini Project 20% 16th week Every student must solve the individual mini
project and submit written report.

10. Academic Honesty


Copying from any outside sources (e.g. Fellow students, and Internet, etc.) on any material to be graded is not
permitted, and will be considered cheating. Cheating will result in failure of the assignment, failure of the class
and/or face possible disciplinary action. Each student is responsible for securing his or her work from copying.
Each student is expected to abide by college policies on academic conduct.
11. Due Date
Individual assignments must be turned in the class on the due date for full credit. No assignment will be
accepted after class on the due date. Papers for this presentation should be submitted and presented on the same
date, if you fail to submit and present on the due date you will be awarded as zero.
12. Classroom Behavior
Anything that disturbs your instructor or your colleagues during the class period is considered a troublesome
behavior. Examples include: Using mobiles, PDA, making offensive remarks, sleeping, working on assignments
related to other courses, etc. troublesome behaviors are completely prohibited.
13. Approval (Affidavit)
Name Signature Date
Instructor:
Section Head:
Department Head:

You might also like