Professional Documents
Culture Documents
Handout OPTIMIZATION PDF
Handout OPTIMIZATION PDF
2. Text Book:
H.A.Taha, Operations Research: An Introduction, Pearson Education, 9th Ed., 2012.
3. Reference Books:
R1. Ronald L. Rardin, Optimization in Operations Research, Pearson Education, 2nd Indian Reprint, 2003.
R2. F. S. Hillier and G. J. Lieberman, Introduction to Operations Research, T M H, 8th Ed, 2005.
R3. Pant J.C., Introduction to Optimization: Operations Research, Jain Brothers, New Delhi, 5th Ed, 2000.
R4. Winston, Operations Research: Applications and Algorithms, Thomson, 3rd Ed, 1996.
R5. Saul I. Gass, Linear Programming Methods and Applications, Dover Publications, 5th edn., 2003.
R6. G.C. Onwubolu and B.V. Babu, New Optimization Techniques in Engineering, Springer, 1st Ed, 2004.
R7. A. Ravindran, D.T. Philips and J.J. Solberg, Operation Research: Principles and Practice, John Wiley &
Sons, 2nd Ed, 2004.
4. Course Plan:
Lec.
Learning Objectives Topics to be Covered Sec No.
No.
To understand the meaning of
1 Introduction to optimization
Optimization
How to develop Linear Programming
models and how to solve two variables Two variable LP model, Graphical LP solution, T1: 2.1, 2,2,
2-6
LP models by the graphical solution Selected LP applications, Convex Set 2.3, 7.1.1
procedure
LP model in equation form, Transition from
7-8 T1: 3.1,3.2
To obtain an understanding of why and graphical to algebraic solution
how the simplex calculations are made Simplex method, Artificial starting solution, T1: 3.3, 3.4,
9-10
and know how to recognize the special Special cases in the simplex method 3.5
situations The Simplex Method, Generalized simplex
11-13 T1: 7.1.2, 7.2
tableau in matrix form
To understand the concept of duality, Definition of Dual Problem, Duality, Primal- T1: 4.1, 7.4,
14-15
how to read and interpret the solution Dual Relationships 4.2
of dual problem and relate the dual Additional simplex algorithms: Dual Simplex
16-17 T1: 4.3, 4.4
solution to the primal solution and to Method, Generalized Simplex Algorithm
explain how post optimal analysis can
18-19 Post optimal Analysis T1: 4.5
be used by a decision maker
Definition of transportation problem, The
20-22 To formulate transportation and T1: 5.1, 5.3
transportation Algorithm
assignment problems as LPP and how
23 to solve these problems The Assignment Model T1: 5.4
To understand Integer Programming Formulation of IP problem Branch and Bound
24-26 T1: 9.1, 9.2.1
problem and its efficacy method for solving IPP
5. Evaluation Scheme:
Weightage
Evaluation Components Duration Date and Time Remarks
(%)
Test I 60 Min. 25 13/09/14, 02.00-03.00 PM CB
Test II 60 Min. 25 18/10/14, 02.00-03.00 PM CB
Surprise test ** 10 **
Comp. Exam 3 Hours 40 01/12/14(FN) CB
** To be announced later.
6. Self Learning Component (SLC): Use TORA, MATLAB and Mathematica software's to solve optimization
problems.
7. Make up Policy: Make up will be given only for genuine cases and for that prior permission has to be obtained
from I/C.
8. Chamber consultation hours: To be announced in class by the respective Instructors.
9. Problems: Students are strongly advised to work out all the problems in the text-book and do similar problems
from the reference books. It is also strongly recommended that the students should try out the algorithms on
computers to get a better understanding of the subject.
10. Notices: All notices in relation to the above course will be put up on Moodle Server.
Instructor-In-Charge
MATH F212/AAOC C222