Operation Research – Problem Solving in Operational Research & Linear Programming | ChalkStreet

Operations Research-3 : Approach to Problem Solving in Operations Research

This course provides a comprehensive overview of important problem scenarios like how to solve Linear Programming Problems using a solver in Operations Research.

FREE

Level
Advanced
# Learners
38
Duration
5 hrs 9 mins
Rating
(1)

About Course

Operational Research is the use of advanced analytical techniques to improve decision making. It is also known as operations research, management science or industrial engineering. As an organization grows more complex, it relies on analysis to make informed decisions that were once made largely based on management intuition.

The Transportation Problem is one of the most important and well addressed problems in Operations Research. The origins of this problem are attributed to Hitchcock (1941) and it was referred to as the Hitchcock problem earlier. It has wide applications in logistics and distribution management. Similarly, Linear Assignment Problem also called Assignment Problem is a special type of a Linear Programming problem. This problem has extensive applications in allocation problems where different entities are allocated or assigned to other entities.

This course covers the approach to problem solving in Operations Research which is essential to solve Linear Programming problems. You will learn about the Transportation Problem, Assignment Problem and how to deal with these problems effectively. You will also be learning about solving Linear Programming Problems using a solver for complex Transportation Problem and Assignment Problem.

On completion of this course, you will not only have a strong foundation in concepts of Operations Research but you will also be able to solve various complex problems related to Linear Programming using a solver. So subscribe to this course now!

You can also subscribe to other topics in this course bundle on Operations Research. The courses can be accessed by following the links below:

Curriculum

Section 1 : Transportation Problem
1.1
Introducting the transportation problem
22:02
1.2
Nort west rule & minimum cost method
22:52
1.3
Penalty cost method
21:44
1.4
MODI method
23:13

Section 2 : Assignment problem
2.1
Introducing the Assigment problem
24:41
2.2
Solving the Assignment problem
22:01
2.3
Hungarian algorithm
20:31
2.4
Unequal number of rows & columns
20:56
2.5
Optimality of the Hungarian algorithm
26:02

Section 3 : Solving LPs using a solver
3.1
Solving LP problem
22:40
3.2
Unboundedness and infeasibility
17:28
3.3
Solving other formulations
20:18
3.4
Solving a transportation problem
22:10
3.5
Solving an assignment problem
23:28

About the Author

Prof. G. Srinivasan
Professor, Department of Management Studies, IIT Madras

G. Srinivasan is an Assistant professor, Department of Management Studies, at IIT Madras. He was also the former NPTEL coordinator

Review and Ratings