Department of Mathematics and Computing

Lesson Plan: VII Int. MTech./JRF

Session: 2023-2024
Course Course
Name of Course L T P Credit
Type Code
DC MCO502 Optimization Techniques 3 0 0 9

Course Objective
The course deals with the basic idea of mathematical programming (Linear and Nonlinear). We
shall see how simple mathematics plays a significance role in the development of these ideas.
Further, explore the different approaches to find the solution for the various Linear and Nonlinear
Programming Problems.
Learning Outcomes
Upon successful completion of this course, students will:
 have the basic nature of the convex set and its solution set.
 Known how we can optimize the path with the help of available resource.
 be able to solve the nonlinear and linear programming problem with different approaches.
 learn the different types of Queuing system according to service, time, etc.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Network Analysis: Basic Concepts, Critical Student will be able to construct
Path Analysis, Program Evaluation Review the network diagrams with single
1 06
Techniques. and three time estimates of
activities involving in a project.
Dynamic Programming: Recursive Student will learn the new
Equation Approach, Dynamic approach to solve the linear
2 Programming Algorithm, Solution of 08 programming problem and their
Discreate D.P.P., Solution of L.P.P. by applications in solving a decision-
Dynamic Programming. problem.
Queuing Theory: Probability Distributions This unit will help student to
in Queuing Systems, Classification of identify and examine all possible
3 Queuing Models, Poisson Queuing 08 queuing system and description of
Systems:-{(M/M/1): (∞/FIFO)}, {(M/M/1) each of them.
:(∞/SIRO)}, {(M/M/1) :(N/FIFO)}.
Convex Analysis: Convex Set, Convex Understanding the fundamental
functions, Local and Global Extrema, concept of the convex set and its
4 Convex Hull, Supporting and Separating 07 solution set.
Hyperplane, Convex Cone, Differentiable
Convex function.
Nonlinear Programming: General Student will be able to drive the
Nonlinear Programming Problem, optimality conditions for obtaining
Constrained Optimization with Equality an optimal solution for nonlinear
5 10
and Inequality Constraints, Saddle Point Optimization with Equality and
Problems, Kuhn-Tucker Conditions with Inequality Constraints.
Nonnegative Constraints.
Text Books:

1. Kanti Swarup, P. K. Gupta and Man Mohan: “Operations Research”, Sultan Chand &
Sons, 2017.

Reference Books:

1. Hamdy A. Taha: “Operations Research-An Introduction”, Pearson, 2016.

2. Hadley G..: “Linear Programming”, Narosa, 2002.
3. Frederick S. Hillier and Gerald J. Lieberman: “Introduction to Operations Research”,
McGraw Hill, 2009.

31-07-2023
Signature with date: