BIRLA INSTITUTE OF TECHNOLOGY AND SCIENCE, PILANI
INSTRUCTION DIVISION
SECOND SEMESTER 2019-2020
Course Handout Part II
Date: 07/01/2020
In addition to part-I (General Handout for all courses appended to the time table) this portion gives
further specific details regarding the course.
Course No. : ME F344
Course Title : ENGINEERING OPTIMIZATION
Instructor-in-charge : VARINDER SINGH
1. Scope and Objective of the Course:
Engineers, scientists, analysts and managers are often faced with the challenge of making trade-
offs between different factors in order to achieve desirable outcomes. Optimization is the process
of choosing these trade-offs in the best way. Optimization problems, having reached a degree of
maturity over the past several years, are encountered in physical sciences, engineering, economics,
industry, planning, and many other areas of human activity. Objective of the course is set to
familiarize the students with standard methods of solving optimization problems.
This course deals with details of various aspects associated with optimization. These include
description of optimization techniques, namely, Linear Programming and Nonlinear Programming,
and their applications to various engineering and science disciplines including economics and
finance. Multi-objective optimization which handles optimization aspects of more than one
objective is also discussed. A brief and informative description of Nontraditional optimization
techniques such as Genetic Algorithms, Differential Evolution, etc. is also provided.
2. Text Book:
T1 HA Taha, Operations Research: An Introduction, Pearson Education/PHI, 8/E, 2007.
Reference Books:
R1 SS Rao, Engineering Optimization: Theory and Practice, New Age International (P) Limited,
Third Edition, 1996
R2 FS Hillier and GJ Lieberman, Introduction to Operations Research, TMH, 8/E, 2006.
R3 WL Winston, Operations Research: Applications and Algorithms, Thomson Learning, 4th
Edition, 2004
R4 JC Pant, Introduction to Optimization: Operations Research, Jain Brothers, New , 6/E, 2004.
R5 A Ravindran, DT Philips and JJ Solberg, Operations Research: Principles and Practice,
John Wiley & Sons, Singapore, Second Edition, 1987
R6 GC Onwubolu and BV Babu, New Optimization Techniques in Engineering, Springer-
Verlag, Heidelberg, Germany, First Edition, 2004.
1
3. Course Plan:
Lecture Ref. To
Learning Objectives Topics to be Covered
Nos. Text book
To understand the
meaning of
Optimization and
Introduction to optimization 1-2
Formulation of LPP
models and NLPP
models
To learn how to solve
two variables LP T1 (2.1,
Two variable LP model, Graphical LP solution, 2,2, 2.3,
models by the 3-6
Selected LP applications, Convex Set 7.1)
graphical solution
procedure
To obtain an 7-8 T1 (3.1,
LP model in equation form, Transition from graphical 7.1.1 , 3.2,
understanding of why to algebraic solution
and how the simplex
calculations are made 3.3., 7.1.2,
and know how to The Simplex Method, Generalized simplex tableau in 9-10 7.2
recognize the special matrix form,
situations 3.4,
3.5)
Artificial starting solution 11-13
Special cases in the simplex method
To understand the Definition of Dual Problem, Duality, Primal-Dual 14-15 T1 (4.1,
concept of duality, Relationships, 7.4,4.2,
how to read and
interpret the solution 4.3, 4.4,
of dual problem and Economic Interpretation of Duality, Additional 16-17
relate the dual solution simplex algorithms (Dual Simplex Method,
to the primal solution Generalized Simplex Algorithm),
and to explain how 4.5)
post optimal analysis Post optimal Analysis
can be used by a 18-19
decision maker
To formulate Definition of transportation problem, The 20-22 T1 (5.1,
transportation and transportation Algorithm, 5.3,
assignment problems
as LPP and how to 5.4)
solve these problems The Assignment Model 23
To understand Goal Programming Formulation, 24 T1 (8.1,
multiples objectives
optimization and how 8.2)
to solve multi Goal Programming Algorithms: The Weights Method 25
objective optimization and The Preemptive Method
2
To understand Integer Formulation of IP problem 26-27 T1 (9.1,
Programming problem
and its efficacy Branch and Bound method for solving IPP 9.2)
Cutting Plane method
How to solve Unconstrained problems, Convex and concave 28 T1(18.1,
Nonlinear functions, Appendix
Programming problem D4)
29-31
Elimination Methods: Fibonacci Method and Golden R1 (5.7),
Section Method,
32-33 T1(19.1.1)
Gradient of a Function, Descent Methods: Steepest T1(19.1.2)
Descent Method and Conjugate Gradient Method, R1( 6.11),
Karush-Kuhn-Tucker (KKT) Conditions, 34 T1(18.2.2)
Quadratic Programming, 35
T1(19.2.2,
Appendix
D3)
4. Evaluation Scheme:
Weightage
Component Duration Marks Date & Time Remarks
(%)
Midsemester 2 hours 30 30 CB
Evaluative
Tutorial/Assignment - 20 20 OB
s
Comprehensive 3 hours 50 50 CB
5. Make-Up Policy: Only genuine cases will be entertained
6. Problems: Students are strongly advised to work out good number of problems in the text-book
and do similar problems from the reference books. It is also recommended that the students should
try out the algorithms on computers to get a better understanding of the subject.
7. Chamber Consultation Hours: Thursday 3:00 PM to 5:00PM.
8. Notice: Notices concerning this course will be put up only on course Moodle page..
INSTRUCTOR-IN-CHARGE
(ME F344)
