Annexure ‘CD – 01’

FORMAT FOR COURSE CURRICULUM

L T P/S SW/FW No. of TOTAL

Course Title: Optimization Methods PSDA CREDIT
UNITS
Credit Units:4
3 - 2 - - 4
Course Level: UG Course Code:CSE444

Course Objectives:
After finishing this course student will be able to get introduction of Optimization Techniques, its applications and importance. This course explores
the basic characteristics of optimization techniques and also introduces basics of linear programming and meta- heuristic search techniques and
service models in details. Finally, it gives overview about the optimization of machine learning techniques and its usage other engineering ptimization.

Pre-requisites:
Knowledge of Caculus, Linear Algebra

Course Contents/Syllabus: Weightage (%)

Module I : Optimization Technique Basics
15%
Engineering application of optimization, statement and classification of optimization problems, optimization techniques,

Module II : Classical Optimization Techniques & Linear Programming

Single variable optimization, multi variable optimization with no constraints multivariable optimization with equality and
inequality constraints.
25%
Linear Programming: Geometry of linear programming, Graphical method, Linear programming (LP) in standard form,
Solution of LP by simplex method, Exceptional cases in LP, Duality theory, Dual simplex method, Sensitivity analysis.
Module III : Non-linear Programmes:
Introduction, unimodes function, elimination methods, unrestricted search, quadratic
20%
and cubic interpolation methods, Direct root method, Direct and Random Search method, Steepest Dissent method,
Conjugate gradients method and Guass-newton method.
Module IV: Integer and Stochastic Programmes:
Introduction, Integer linear programming, Methods for solving integer linear programming problems, Stochastic linear 20%
programming, Quadratic programming separable programming.
Module V: Introduction To Meta Heuristics
Introduction to Meta Heuristics, Classification of Meta heuristics ,Tabu Search, Basic Tabu search, Neighborhood, Genetic
Algorithms- Basic concepts, Encoding, Selection, Crossover, Mutation. Simulated Annealing - Acceptance probability, 20%
Cooling, Neighborhoods, Cost function. Application of GA and Simulated Annealing in solving sequencing and scheduling
problems and Travelling salesman problem.

Course Learning Outcomes:

1. Formulate mathematical models for optimization problems.
2. Analyze the complexity of solutions to an optimization problem.
3. Design programs using meta-heuristic search concepts to solve optimization problems.
4. Develop hybrid models to solve an optimization problem.

Pedagogy for Course Delivery:

 Course content will be delivered online using power point presentation. 

 Assignment and tutorial will be discussed and evaluated using online mode.
 Reviewing relevant, previously-learned topics.
 Presenting the new information by linking it to previous case studies.
 Providing learning guidance and assignments.
 Providing time for practice, problem solving sessions and feedback.
 Taking tests and quiz on a regular basis.

Lab/ Practicals details, if applicable:

List of Experiments:
 Write a Program to find the solution of a linear programming problem using Simplex Method.
 Write a Program to find the solution of a linear programming problem using Dual Simplex Method.
 Write a Program to find the solution of a Non linear programming problem using Random Search Method.
 Write a Program to find the solution of a Non linear programming problem using Steepest Decent Method.
 Write a Program to find the solution of a Non linear programming problem using Gauss Newton Method.
  Write a Program to find the solution of a Non linear programming problem using Conjugate Gradient Method
 Write a Program to find the solution of a Non linear programming problem using Conjugate Gradient Method.
 Write a Program to implement Genetic algorithm for Traveling Salesmen Problem.
 Write a Program to implement Simulated Annealing algorithm for Traveling Salesmen Problem.
 Write a Program to implement Tabu Search algorithm for Traveling Salesmen Problem.

Assessment/ Examination Scheme:

Theory L/T (%) Lab/Practical/Studio (%) Total

75% 25% 100%

Theory Assessment (L&T):

Continuous Assessment/Internal Assessment 40% End Term Examination
60%
Components (Drop down) Attendance Class Test HA Quiz EE

Weightage (%) 5 15 10 10 60

Lab/ Practical/ Studio Assessment:

Continuous Assessment/Internal Assessment End Term Examination

(40 %) (60 %)

Components (Drop down Lab record Performance Viva Attendance Practical Viva Total
Performance

Weightage (%) 10 15 10 5 30 30 60

Text Reading:
1. Rao S.S., Optimization Theory and Applications, Wiley Eastern.
2. “Optimization for Engineering Design: algorithm and example” by Kalyanmoy Deb, PHI
 3. G. Zapfel, R. Barune and M. Bogl, Meta heuristic search concepts: A tutorial with applications to production and logistics, Springer.
References:
1. V.Chavtal, “Linear Programming”, W.H. Freeman and Company, New York
2. C.H.Papaddimitriou and K. Steiglitz, “Combinatorial Optimization: Algorithms and Complexity”,
3. Goldberg, Genetic algorithms in Search, optimization and Machine Learning, Addison Wesley.