Scribd
Upload
3 views

Optimization Techniques (1)

The course 'Optimization Techniques' focuses on foundational principles of operations research and optimization, including linear programming, transportation, assignment, and scheduling models. Students will learn to apply various optimization methods and tools, such as the simplex method, goal programming, and game theory, to real-world scenarios. Upon completion, students will demonstrate proficiency in optimization software and be equipped to analyze and solve complex decision-making problems.

Uploaded by

rvs1024p
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views

Optimization Techniques (1)

The course 'Optimization Techniques' focuses on foundational principles of operations research and optimization, including linear programming, transportation, assignment, and scheduling models. Students will learn to apply various optimization methods and tools, such as the simplex method, goal programming, and game theory, to real-world scenarios. Upon completion, students will demonstrate proficiency in optimization software and be equipped to analyze and solve complex decision-making problems.

Uploaded by

rvs1024p
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Course Title: Optimization Techniques

Lecture–Tutorial–Practical: 2-0-0
Credits: 2
Internal Marks: 30
External Marks: 70
Prerequisites
Students are expected to have prior knowledge of Engineering Mathematics,
Linear Algebra, and basic programming concepts.
Course Objectives
1. To provide a foundational understanding of operations research, optimization
principles, and the basics of linear programming, including the simplex method
and its applications.
2. To develop students' skills in solving linear programming problems using the
simplex method, including scheduling problems, and to understand duality and
sensitivity analysis in optimization.
3. To introduce students to transportation, assignment, scheduling, and network
models, along with their applications in real-world optimization scenarios.
4. To familiarize students with goal programming, decision analysis, and game
theory as tools for handling multiple objectives and competitive situations in
decision-making.
5. To present concepts of inventory theory, break-even analysis, and practical
applications of optimization techniques in case studies and real-world
scenarios.
Course Outcomes
Upon completion of the course, students will be able to:
 CO1: Understand foundational principles in operations research and
optimization, including linear programming and resource allocation models.
 CO2: Formulate and solve linear programming problems using the simplex
method, analyze duality relationships, and perform sensitivity analysis.
 CO3: Apply transportation, assignment, scheduling, and network models in
logistics and supply chain contexts.
 CO4: Utilize goal programming, game theory, and decision analysis techniques
for multi-objective and competitive decision-making situations.
 CO5: Analyze inventory models and conduct break-even analysis for cost-
effective resource management and project planning.
 CO6: Demonstrate proficiency in optimization software and apply optimization
methods to real-world case studies in engineering and management.

Contribution of Course Outcomes towards Program Outcomes (1 – Low, 2 –


Medium, 3 – High)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 3 2 - - - 2 - 1 - - - 1 3 1 1

CO2 3 3 1 2 1 2 - 1 - - - 1 3 1 1

CO3 3 3 - 1 1 1 - 1 - - - 1 3 2 -

CO4 3 3 - 2 1 1 - 1 - - - 1 3 2 1

CO5 3 2 1 2 1 1 - 1 - - - 1 3 1 1

CO6 3 2 - 2 1 1 - 1 - - - 1 3 2 1

Unit I: Introduction to Operations Research and Linear Programming


Overview of Operations Research: Scope, applications, and model-building
in OR.
Basics of Linear Programming (LP): Objective function, constraints,
feasible region, and graphical solution.
Simplex Method: Algorithm and applications for solving LP problems.
Special Cases in Simplex: Degeneracy, unbounded, and infeasible
solutions.
Unit II: Transportation and Assignment Problem
Transportation Problem: Formulation, initial feasible solution, and optimality
tests.
Assignment Problem: Solving using the Hungarian method.
Unit III: Sequencing and Project Scheduling
Sequencing Problems: Basic concepts, Gantt charts, job sequencing, single
machine, and multi-machine scheduling problems.
PERT/CPM Models: Shortest path problems, maximum flow problems, and
applications in project scheduling.
Unit IV: Inventory Theory and Break-even Analysis
Inventory Models: Economic Order Quantity (EOQ), safety stock, and
probabilistic inventory models.
Break-even Analysis: Applications in financial planning and cost
management.
Unit V: Game Theory and Decision Analysis
Game Theory: Concepts of zero-sum games, minimax theorem, and Nash
equilibrium.
Decision Analysis: Decision-making under uncertainty, decision trees, and
expected value criteria.
Recommended Textbooks
1. "Operations Research" by P Sankara Iyyer, McGraw Hill Publications, 2016.
2. "Operations Research: An Introduction" by Hamdy A. Taha, Pearson
Publications, 9th edition, 2019.
3. "Operations Research" by R Panneerselvam, PHI Publication, 2nd edition,
2010.
Reference Books
1. "Optimization in Operations Research" by Ronald L. Rardin.
2. "Introduction to Optimization" by Pablo Pedregal.
3. "Operations Research: Principles and Practice" by Ravindran, Phillips, and
Solberg.
E-Resources
1. Institute for Operations Research.
2. Analytics Vidhya on Operations Research.
3. NPTEL Course on Operations Research.

You might also like