Download as pdf or txt
Download as pdf or txt
You are on page 1of 3

SYLLABUS: OPTIMIZATION IN ENGINEERING-(6TH SEM) CSE, IT, CE: IIIT BBSR

CODE TITLE OF THE SUBJECT

MA-105 Optimization in Engineering

Credits: 3 (3-0-0)

Pre-requisite for Mathematics –I & Mathematics –II (Taught in 1st year)


this course:

Course Objective: The course aims to:

• To introduce various optimization techniques i.e. classical, linear &

non-linear programming, transportation problem, simplex algorithm, •


Constrained and unconstrained optimization techniques for solving many
optimization problems in real world situations.

Course Outcome: On completion of the course, a student should be able to:

• explain the need of optimization of engineering systems

• apply classical optimization techniques, linear programming, simplex

algorithms, and algorithms for network analysis.


• apply unconstrained optimization and constrained non-linear

programming problems
• Formulate optimization problems.

Syllabus

Module I Scope of Operations Research: Introduction to linear and


nonlinear programming formulation of different models.
[12] Hours

Linear Programming: Geometry of linear programming, Graphical


method, Linear programming (LP) in standard form, Solution of LP by
simplex and revised simplex methods, Exceptional cases in LP, Duality
theory, Dual Simplex method, Sensitivity analysis.
SYLLABUS: OPTIMIZATION IN ENGINEERING-(6TH SEM) CSE, IT, CE: IIIT BBSR
Module II Integer Programming: Branch and bound algorithm.

[7] Hours Network Analysis: Transportation problem, Transshipment


problem, Assignment problem.

Module III Nonlinear Programming: Characteristics, Concepts of convexity, One


dimensional search method, Fibonacci, golden section method, gradient
[11] Hours
methods for unconstrained problems.

Constrained optimization with equality constraint: Lagrange multiplier,


Constrained optimization with inequality constraint: Kuhn-Tucker
condition, Quadratic programming.

Gradient descent method, Newton’s method

Software(s): Introduction to any solver(S) for optimization techniques.

(Problems of each module to be solved by the software(s) chosen by


the instructor. It will be asked to the students as Assignment(s).)
Suggested Books: • George Bernard Dantzig, Mukund Narain Thapa, “Linear programming”,

Springer series in operations research 3rd edition, 2003. • H.A. Taha,


“Operations Research: An Introduction”, 8th Edition, Pearson/Prentice Hall,
2007.
• Singiresu S. Rao, Engineering Optimization: Theory and Practice by

John Wiley and Sons, 4th edition, 2009.


• H. S. Kasene & K. D. Kumar, Introductory Operations Research,

Springer (India), Pvt. Ltd., 2004


• Kasana, H.S., Introductory Operation Research: Theory and

Applications, Springer Verlag (2005).


• Rardin, Ronald L., Optimization in Operations research, Pearson

Education (2005).
• Ravindran A, Philips D.T. and Solberg J.J. Operation Research:

Principles and Practice, John Wiley (2007)

You might also like