SIR C R REDDY COLLEGE OF ENGINEERING

DEPARTMENT OF INFORMATION TECHNOLOGY

COURSE HANDOUT

Subject: OPTIMIZATION TECHNIQUES

Code: R2322121
Class: II/IV B.Tech Semester: II

Academic year: 2024-25

Section-A Section-B Section-C

Course handlers Mrs.M.Durga Ratnam Ms.K.Kavyanjali Mrs.M.Durga Ratnam

Course coordinator Mrs..Durga Ratnam
 SIR C R REDDY COLLEGE OF ENGINEERING
ELURU-534007, ELURU DIST, A P., INDIA
(Approved by AICTE, New Delhi)
Accredited by NBA
Phone no: 08812-230840, 2300656 Fax: 08812-224193
Visit us at http://www.sircrrengg.ac.in
DEPARTMENT OF INFORMATION TECHNOLOGY

COLLEGE VISION
To emerge as a premier institution in the field of technical education and research in the state
and
as a home for holistic development of the students and contribute to the advancement of
society
and the region.
COLLEGE MISSION
To provide high quality technical education through a creative balance of academic and
industry
oriented learning; to create an inspiring environment of scholarship and research; to instill
high
levels of academic and professional discipline; and to establish standards that inculcate
ethical
and moral values that contribute to growth in career and development of society in general.
VISION OF THE DEPARTMENT
To be a premier Department in the region in the field of Information Technology through
academic excellence and research that enable graduates to meet the challenges of industry
and
society
MISSION OF THE DEPARTMENT
❖ To Provide dynamic teaching-learning environment to make the students industry ready
and advancement in career;
❖ To inculcate professional and leadership quality for better employability and
entrepreneurship;
❖ To make high quality professional with moral and ethical values suitable for industry and
society
 SIR C R REDDY COLLEGE OF ENGINEERING
ELURU-534007, ELURU DIST, A P., INDIA
(Approved by AICTE, New Delhi)
Accredited by NBA
Phone no: 08812-230840, 2300656 Fax: 08812-224193
Visit us at http://www.sircrrengg.ac.in
DEPARTMENT OF INFORMATION TECHNOLOGY

Programmable Educational Objectives (PEOs)

The Program Educational Objectives of B.Tech (IT) program are as follows:

PEO1: Solve real world problems through effective professional skills in Information
Technology industry and academic research.
PEO2: Analyze and develop applications in Information Technology domain and adapt to
changing technology trends with continuous learning.
PEO3: Practice the profession in society with ethical and moral values.

Program Specific Outcomes:

PSO1: Conceptual Skills: Apply core information technology of systems, architecture,

information management, programming, networking for development of current technical
concepts.
PSO2: Technical Skills: Design and develop software by adapting emerging technologies
for the need of IT industry
 SIR C R REDDY COLLEGE OF ENGINEERING
ELURU-534007, ELURU DIST, A P., INDIA
(Approved by AICTE, New Delhi)
Accredited by NBA
Phone no: 08812-230840, 2300656 Fax: 08812-224193
Visit us at http://www.sircrrengg.ac.in
DEPARTMENT OF INFORMATION TECHNOLOGY

Programme Outcomes (POs)

PROGRAM OUTCOMES ARE THE KNOWLEDGE, SKILLS, AND ABILITIES

STUDENTS SHOULD POSSESS WHEN THEY GRADUATE FROM A PROGRAM.

PO1: Engineering knowledge: Apply the knowledge of mathematics, science, engineering

fundamentals, and an engineering specialization to the solution of complex engineering
problems.

PO2: Problem analysis: Identify, formulate, review research literature, and analyze complex
engineering problems reaching substantiated conclusions using first principles of
mathematics, natural sciences, and engineering sciences.

PO3: Design/development of solutions: Design solutions for complex engineering

problems and design system components or processes that meet the specified needs with
appropriate consideration for the public health and safety, and the cultural, societal, and
environmental considerations.

PO4: Conduct investigations of complex problems: Use research-based knowledge and

research methods including design of experiments, analysis and interpretation of data, and
synthesis of the information to provide valid conclusions.

PO5: Modern tool usage: Create, select, and apply appropriate techniques, resources, and
modern engineering and IT tools including prediction and modeling to complex engineering
activities with an understanding of the limitations.

PO6: The engineer and society: Apply reasoning informed by the contextual knowledge to
assess societal, health, safety, legal and cultural issues and the consequent responsibilities
relevant to the professional engineering practice.
PO7: Environment and sustainability: Understand the impact of the professional
engineering solutions in societal and environmental contexts, and demonstrate the knowledge
of, and need for sustainable development.

PO8: Ethics: Apply ethical principles and commit to professional ethics and responsibilities
and norms of the engineering practice.

PO9: Individual and team work: Function effectively as an individual, and as a member or
leader in diverse teams, and in multidisciplinary settings.

PO10: Communication: Communicate effectively on complex engineering activities with

the engineering community and with society at large, such as, being able to comprehend and
write effective reports and design documentation, make effective presentations, and give and
receive clear instructions.

PO11: Project management and finance: Demonstrate knowledge and understanding of the
engineering and management principles and apply these to one’s own work, as a member
and leader in a team, to manage projects and in multidisciplinary environments.

PO12: Life-long learning: Recognize the need for, and have the preparation and ability to
engage in independent and life-long learning in the broadest context of technological change.
 SIR C R REDDY COLLEGE OF ENGINEERING
ELURU-534007, ELURU DIST, A P., INDIA
(Approved by AICTE, New Delhi)
Accredited by NBA
Phone no: 08812-230840, 2300656 Fax: 08812-224193
Visit us at http://www.sircrrengg.ac.in
DEPARTMENT OF INFORMATION TECHNOLOGY
COURSE DESCRIPTION

Subject: OPTIMIZATION TECHNIQUES

Class: II/IV Semester-II A, B &C Sections
Branch: INFORMATION TECHNOLOGY

1. Target:
a. Percentage of Pass: 80%
b. Percentage of A grades:60%

2. Course Description:
An optimization techniques course teaches students how to solve problems by optimizing a
system’s performance or objectives. The course covers a variety of optimization techniques
and their modern applications. Students will learn how to solve linear programming problems
and Transportation problems using various methods and know how to design a dynamic
programming problem..

3. Learning Objectives:

By the end of the course, students should be able to:

1. Define an objective function and constraint functions in terms of design variables,

and then state the optimization problem.
2. State single variable and multi variable optimization problems, without and with
constraints.
3. Explain linear programming technique to an optimization problem, define slack and
surplus variables, by using simplex method.
4. State transportation and assignment problem as a linear programming problem to
determine simplex method. Study and explain nonlinear programming techniques,
unconstrained or constrained, and define exterior and interior penalty functions for
optimization problems.

4.Course Outline: An optimization techniques course typically covers the basics of

optimization, classical and advanced optimization methods, and how to apply optimization in
engineering.
 5. Prerequisites:
Basic understanding of derivatives, integrals and multivariable calculus is crucial for
analyzing optimization problems.

6. Teaching Methodology:

 Lectures: Theoretical concepts, explanations, and discussions on real-world

Optimization techniques problems.
 Assignments: Topic wise questions are given to the students to practice and also
some tutorial sheets are given to the students to give better performance in coming
exams.
 Exams: Mid-term and final exams assessing theoretical understanding.

7. Assessment:

 Assignments/Projects:(Design and implementation tasks)

 Midterm Exam:(Concepts and practical applications)
 Final Exam: (Comprehensive assessment of theoretical and hands-on skills)

8. Recommended Textbooks:
1. “Engineeringoptimization:Theoryandpractice”,S.S.Rao,NewAgeInternational
(P)Limited,3rdedition,1998.

2. “Introductory Operations Research”, H.S. Kasene & K.D. Kumar,

Springer (India), Pvt. Ltd.

9. Reference Books:
1. “Optimization Methods in Operations Research and systems Analysis”,by
K.V. Mital and C. Mohan, New Age International (P) Limited, Publishers,
3rd edition, 1996.
2. Operations Research, Dr.S.D. Sharma, Kedarnath, Ramnath &Co

11. Web-Resources:
1) https://nptel.ac.in/courses/106/105/111105039
2) https://youtu.be/_awAywLKuEQ?si=2ooHFwMwG1947anC
 SIR C R REDDY COLLEGE OF ENGINEERING
ELURU-534007, ELURU DIST, A P., INDIA
(Approved by AICTE, New Delhi)
Accredited by NBA
Phone no: 08812-230840, 2300656 Fax: 08812-224193
Visit us at http://www.sircrrengg.ac.in
DEPARTMENT OF INFORMATION TECHNOLOGY
OPTIMIZATION TECHNIQUES

Syllabus

UNITI: Introduction and Classical Optimization Techniques:

Statement of an Optimization problem, design vector, design constraints, constraint
surface, objective function, objective function surfaces, classification of Optimization
problems.
Classical Optimization Techniques: Single variable Optimization, multi
variableOptimizationwithoutconstraints,necessaryandsufficientconditionsfor
minimum/maximum,multivariableOptimizationwithequalityconstraints.Solutionby
methodofLagrangemultipliers,multivariableOptimizationwithinequalityconstraints,
Kuhn – Tucker conditions

UNITII : Linear Programming:

Standard form of a linear programming problem, geometry of linear programming
problems, definitions and theorems ,solution of a system of linear simultaneous
equations, pivotal reduction of a general system of equations, motivation to the simplex
method, simplex algorithm.
UNITIII: Transportation Problem:
Finding initial basic feasible solution by north – west corner rule, least cost method and
Vogel’s approximation method, testing for optimality of balanced transportation problems,
Special cases in transportation problem.

UNITIV: Nonlinear Programming:

Unconstrained cases, One – dimensional minimization methods: Classification, Fibonacci
method, Univariate method, steepest descent method. Constrained cases– Characteristics of
a constrained problem, Classification, Basic approach of Penalty Function method, Basic
approaches of Interior and Exterior penalty function methods,

UNITV:Dynamic Programming:
Dynamic programming multistage decision processes, types, concept of sub
optimization and the principle of optimality, computational procedure in dynamic
programming, examples illustrating the calculus method of solution, examples
illustrating the tabular method of solution.

Textbooks:
1.“Engineeringoptimization:Theoryandpractice”,S.S.Rao,NewAgeInternational
(P)Limited,3rdedition,1998.
2. “Introductory Operations Research”, H.S. Kasene & K.D. Kumar, Springer
(India), Pvt.LTd.

Reference Books:
3. “Optimization Methods in Operations Research and systems Analysis”, by
K.V. Mital and C. Mohan, New Age International (P) Limited, Publishers, 3rd
edition, 1996.
4. Operations Research, Dr.S.D.Sharma,Kedarnath,Ramnath&Co
 SIR C R REDDY COLLEGE OF ENGINEERING
ELURU-534007, ELURU DIST, A P., INDIA
(Approved by AICTE, New Delhi)
Accredited by NBA
Phone no: 08812-230840, 2300656 Fax: 08812-224193
Visit us at http://www.sircrrengg.ac.in
DEPARTMENT OF INFORMATION TECHNOLOGY
ACADAMIC CALENDAR
Individual Time table
 SIR C R REDDY COLLEGE OF ENGINEERING
ELURU-534007, ELURU DIST, A P., INDIA
(Approved by AICTE, New Delhi)
Accredited by NBA
Phone no: 08812-230840, 2300656 Fax: 08812-224193
Visit us at http://www.sircrrengg.ac.in
DEPARTMENT OF INFORMATION TECHNOLOGY
OPTIMIZATION TECHNIQUES
RELATIONSHIP OF COURSE OUTCOMES TO PROGRAM OUTCOMES

Course Outcomes:

On completion of this subject/course the students shall be able to:

Cognitive
CO Course Outcomes description
Level
Apply classical optimization techniques to minimize or maximize a
CO1 multi-variable objective function, without or with constraints, and arrive L3
at an optimal solution.
CO2 Solve Linear programming problems by using Simplex algorithm. L3
CO3 Apply various methods to Solve transportation problem.
L3
.
Apply gradient and non-gradient methods to nonlinear optimization
CO4 problems and use interior or exterior penalty functions for the constraints L3
to derive the optimal solutions
Apply Dynamic programming technique to inventory control,
CO5 production planning, engineering design problems etc.to reach a
L3
final optimal solution from the current optimal solution.
 Course Outcome - Program Outcome relationship matrix (indicate the relationships by
mark):
Course
PO PO PO PO PO PO PO PO PO PO PO PO PS0 PS0
out/Pro
1 2 3 4 5 6 7 8 9 10 11 12 1 2
outcomes
CO1 3 2 - - - - - - - - - - - -

CO 2 3 2 - - - - - - - - - - -
CO 3 3 2 - - - - - - - - - - - -
CO 4 3 2 - - - - - - - - - - - -
CO5 3 2 - - - - - - - - - - - -
Avg 3 2 - - - - - - - - - - - -

MAPPING OF COs TO POs (WITH LEVELS

3: HIGH, 2: MODERATE, 1: LOW, - : NO CORRELATION
 SIR C R REDDY COLLEGE OF ENGINEERING
ELURU-534007, WEST GODAVARI DIST, A P., INDIA
(Approved by AICTE, New Delhi)
Accredited by NBA
Phone no: 08812-230840, 2300656 Fax: 08812-224193
Visit us at http://www.sircrrengg.ac.in
DEPARTMENT OF INFORMATION TECHNOLOGY
CO-PO-PSO JUSTIFICATION
OPTIMIZATION TECHNIQUES

Justification for CO-PO Mapping

CO1: Apply classical optimization techniques to minimize or maximize a
multi-variable objective function, without or with constraints, and arrive at
an optimal solution.
PO1 (Engineering Knowledge): Apply the knowledge of derivatives in solving
optimization problems.
PO2 (Problem Analysis): Identify the different optimization problems; with and
without constraints.
CO2: Solve Linear programming problems by using Simplex algorithm.
PO1 (Engineering Knowledge): apply the knowledge of LPP to solve system of
linear simultaneous equations.
PO2 (Problem Analysis): Use Simplex algorithm to solve LPP of linear equations.
CO3: Apply various methods to Solve transportation problem.
PO1 (Engineering Knowledge): Define transportation problem and select
appropriate methods to solve LPP.
PO2 (Problem Analysis): Apply different methods to solve transportation problem.
CO4: Apply gradient and non-gradient methods to nonlinear optimization
problems and use interior or exterior penalty functions
for the constraints to derive the optimal solutions.
PO1 (Engineering Knowledge): Apply the knowledge of optimization
techniques to solve non linear programming problems.
PO2 (Problem Analysis): use the interior and exterior penalty functions to
solve non linear programming problems.
CO5:Apply Dynamic programming technique to inventory
control, production planning, engineering design problems etc.to reach a
final optimal solution from the current optimal solution.
PO1 (Engineering Knowledge): Classify the types of dynamic
programming problems and give some examples.
PO2 (Problem Analysis): Apply the principle of optimality to solve the
dynamic programming models. Justification for CO-PSO Mapping
 SIR C R REDDY COLLEGE OF ENGINEERING
ELURU-534007, ELURU DIST, A P., INDIA
(Approved by AICTE, New Delhi)
Accredited by NBA
Phone no: 08812-230840, 2300656 Fax: 08812-224193
Visit us at http://www.sircrrengg.ac.in
DEPARTMENT OF INFORMATION TECHNOLOGY
 COURSE SCHEDULE PLAN
OPTIMIZATION TECHNIQUES
The schedule for the whole course/subject is:

S.N Description Total No.

o of Periods
1 UNITI: Introduction and Classical Optimization Techniques:
Statement of an Optimization problem, design vector, design constraints,
constraint surface, objective function, objective function surfaces,
classification of Optimization problems.
Classical Optimization Techniques: Single variable Optimization, multi
variableOptimizationwithoutconstraints,necessaryandsufficientconditionsfor 10L + 2T
minimum/maximum,multivariableOptimizationwithequalityconstraints.Soluti
onby
methodofLagrangemultipliers,multivariableOptimizationwithinequalityconstr
aints, Kuhn – Tucker conditions

2
UNITII: Linear Programming:
Standard form of a linear programming problem, geometry of linear
programming problems, definitions and theorems, solution of a system of 10L+ 2T
linear simultaneous equations, pivotal reduction of a general system of
equations, motivation to the simplex method, simplex algorithm.

3 UNITIII: Transportation Problem:

Finding initial basic feasible solution by north – west corner rule, least cost
method and Vogel’s approximation method, testing for optimality of balanced
transportation problems, Special cases in transportation problem.

4 UNITIV: Nonlinear Programming:

Unconstrained cases, One – dimensional minimization methods:
Classification, Fibonacci method, Univariate method, steepest descent
method. Constrained cases– Characteristics of a constrained problem, 10L + 2T
Classification, Basic approach of Penalty Function method, Basic approaches
of Interior and Exterior penalty function methods,

5 UNITV: Dynamic Programming:

Dynamic programming multistage decision processes, types, concept of
sub optimization and the principle of optimality, computational procedure
in dynamic programming, examples illustrating the calculus method of 10L + 2T
solution, examples illustrating the tabular method of solution.
L-LECTURE T-TUTORIAL

Total no of available periods : 60 Periods

Total no of estimated periods : 50L + 10T Periods = 60 Periods

SIR C R REDDY COLLEGE OF ENGINEERING

ELURU-534007, ELURU DIST, A P., INDIA
(Approved by AICTE, New Delhi)
Accredited by NBA
Phone no: 08812-230840, 2300656 Fax: 08812-224193
Visit us at http://www.sircrrengg.ac.in
DEPARTMENT OF INFORMATION TECHNOLOGY
OPTIMIZATION TECHNIQUES SYSTEMS
LECTURE PLAN

Teaching
Unit Topics CO
Aids
Introduction- Optimization Techniques
BB/PPT 1
 Course Outcomes BB/PPT 1

Statement of an Optimization problem, design vector, BB/PPT 1

I design constraints, constraint surface
objective function, objective function surfaces,
BB/PPT 1
classification of Optimization problems BB/PPT 1
classification of Optimization problems BB/PPT 1
Introduction to Classification Techniques BB/PPT 1
Single Variable Optimization necessary condition
BB/PPT 1
Single Variable Optimization sufficient condition
BB/PPT 1
Multi Variable Optimization condition
BB/PPT 1

Multi Variable Optimization with no constraints BB/PPT 1

condition
Multi Variable Optimization with equality constraints BB/PPT 1
condition
Lagrange Multiplier Method BB/PPT 1

Multi Variable Optimization with inequality BB/PPT 1

constraints condition and Kuhn Tucker Method
Introduction to Linear Programming problems 2
BB/PPT
Standard form of a linear programming problem, BB/PPT 2
Geometry of linear programming problems BB/PPT 2
II 2
Definitions and theorems, solution of a system of linear BB/PPT
simultaneous equations
Solution of a system of linear simultaneous equations BB/PPT 2

Pivotal reduction of a general system of equations, BB/PPT 2

motivation to the simplex method BB/PPT 2
Simplex algorithm. BB/PPT 2

Simplex algorithm. BB/PPT 2

Finding initial basic feasible solution 3

BB/PPT

Balanced Transportation problem and Unbalanced 3

BB/PPT
Transportation problem
 Procedure of North West corner cell method BB/PPT 3
Problems on North West corner cell method BB/PPT 3
least cost method
BB/PPT 3
Problems on North West corner cell method 3
BB/PPT
Vogel’s approximation method
BB/PPT 3

Vogel’s approximation method 3

III BB/PPT
Testing for optimality of balanced transportation BB/PPT 3
problems
Testing for optimality of balanced transportation BB/PPT 3
problems
Special cases in transportation problem BB/PPT 3
Special cases in transportation problem BB/PPT 3
Introduction to Non linear Programming BB/PPT 4
Problem
Unconstrained cases, One – dimensional minimization BB/PPT 4
methods
Classification, Fibonacci method BB/PPT 4
Univariate method 4
BB/PPT
IV
Steepest descent method. BB/PPT 4
Constrained cases– Characteristics of a constrained BB/PPT 4
problem,
Classification of Penalty Function method BB/PPT 4
Basic approach of Penalty Function method BB/PPT 4
Basic approaches of Interior and Exterior penalty BB/PPT 4
function methods
Basic approaches of Interior and Exterior penalty BB/PPT 4
function methods
Problems BB/PPT 4
Problems BB/PPT 4
Dynamic programming Introduction BB/PPT 5
Dynamic programming multistage decision BB/PPT 5
processes
Programming multistage decision processes and BB/PPT 5
types
Types of Programming multistage decision processes BB/PPT 5
V Concept of sub optimization BB/PPT 5
The principle of optimality , computational procedure BB/PPT 5
 in dynamic programming
Computational procedure in dynamic programming BB/PPT 5
Examples illustrating the calculus method of solution BB/PPT 5
Examples illustrating the tabular method of solution BB/PPT 5
Problems
BB/PPT 5
Problems BB/PPT 5

Total no of instructional periods available for the course : 60 periods

Total no of estimated periods : 50L+10T periods

Evaluation Criteria

The performance of a student in each semester shall be evaluated subject wise with a maximum
of 100 marks for theory and 100 marks for practical subject. A student has to secure not less than
35% of marks in the end examination and a minimum of 40% of marks in the sum total of the
mid semester and end examination marks taken together for the theory, practical, design, drawing
subject or project etc. In case of a mandatory course, he/she should secure 40% of the total
marks.
Assessment Method Marks
Continuous Internal Assessment 30
Semester End Examination 70
Total 100

a) For theory subject, the distribution shall be 30 marks for Internal Evaluation and 70
marks for the End-Examination.
b) For practical subject, the distribution shall be 30 marks for Internal Evaluation and
70 marks for the End- Examination.
.
Continuous Internal Evaluation
a) For theory subjects, during the semester, there shall be two midterm examinations.
Each midterm examination shall be evaluated for 30 marks of which 10 marks for
objective paper (20 minutes duration), 15 marks for subjective paper (90 minutes
duration) and 5 marks for assignment.
b) Objective paper shall contain for 05 short answer questions with 2 marks each or
maximum of 20 bits for 10 marks. Subjective paper shall contain 3 either or type
questions (totally six questions from 1 to 6) of which student has to answer one from
 each either-or type of questions. Each question carries 10 marks. The marks
obtained in the subjective paper are condensed to 15 marks.

Final mid semester marks shall be arrived at by considering the marks secured by the student in
both the mid examinations with 80% weightage given to the better mid exam and 20% to the
other.
For Example:
Marks obtained in first mid: 25 Marks obtained in second mid: 20
Final mid semester Marks: (25x0.8) + (20x0.2) = 24
If the student is absent for any one midterm examination, the final mid semester marks shall be
arrived at by considering 80% weightage to the marks secured by the student in the appeared
examination and zero to the other.
For Example:
Marks obtained in first mid: Absent Marks obtained in second mid: 25
Final mid semester Marks: (25x0.8) + (0x0.2) =20

End Examination Evaluation:

End examination of theory subjects shall have the following pattern:
i) There shall be 6 questions and all questions are compulsory.
ii) Question I shall contain 10 compulsory short answer questions for a total of 20marks
such that each question carries 2 marks.
iii) There shall be 2 short answer questions from each unit.
In each of the questions from 2 to 6, there shall be either/or type questions of 10
marks each. Student shall answer any one of them.
iv) The questions from 2 to 6 shall be set by covering one unit of the syllabus for each
question.

Section-A Section-B Section-C

Course handlers
Mrs.M.Durga Ratnam Ms.K.Kavyanjali Mrs.M.Durga Ratnam

Course Mrs.M.Durga Ratnam

Co-ordinator
Dr K Satyanarayana
HOD