To understand the methods which will be helpful to optimize your solution to transportation problems, we must have the knowledge of optimality tests first. Jump to Modified Distribution Method(MODI) or Stepping Stone Method for optimizing solution to transportation problem.
As we discussed in MODI method that, to understand these methods which will be used to get optimum solution to transportation problem, we need to get knowledge of optimality test first.
Vogel's Approximation Method (VAM) is one of the method to obtain feasible solution of Transportation Problem. We already know the Least Cost Method and the North West Corner Method for transportation problem to obtain feasible solution.
Transportation Model is a special case of LPP(Linear Programming Problem) in which the main objective is to transport a product from various sources to various destinations at total minimum cost.
The North West corner method is one of the methods to obtain a basic feasible solution of the transportation problems (special case of LPP). We will now see how to apply this very simple method to a transportation problem. We will study steps of this method while applying it in the problem itself.
Least cost Method is one of the method to obtain feasible solution of Transportation Problem. We already understand the North West Corner Method for transportation problem, to obtain feasible solution. To understand Least Cost Method we will go through the numerical provided as follows (the same numerical we used in North West Corner Method
Solve the following problem for BFS using VAM method (Tie in selecting row and column). Note: Important point to remember for VAM - Case of Tie. 1) If the "smallest cost" in a row or column are repeating, then difference for that row or column is "0".
Assignment model is a special application of Linear Programming Problem (LPP), in which the main objective is to assign the work or task to a group of individuals such that; i) There is only one assignment.
As we have understood the method of crashing in the video, let us move to the special case of Crashing. (If you have not watched the video yet, click on the "Watch Video" button above and clear your doubts about the method now.) As title suggest, we will discuss the numerical which will have more than 1 critical path, i.e. Multiple Critical Paths.
As we have understand the method of crashing in the video, let us move to the special case of Crashing. (If you have not watched the video yet, click on the button above and clear your doubts about the method now.)
PERT is the technique used to find project completion time of “variable activities”. In PERT, the time is combination of three different time estimations. Following are the three different time estimation:
For the given activities determine: 1. Critical path using PERT. 2. Calculate variance and standard deviation for each activity. 3. Calculate the probability of completing the project in 26 days.
Many of you are engineering students, and you will be Project Managers soon in your particular field. Also, many of you are working as Project managers. So, this topic of network analysis is related all such management work.
It is the simplest method to solve LPP, with a limitation that it is used only for two variables. It is because we will be using Cartesian planes (XY-graph) to solve the problems.
At the time of World War- II, G.B. Dantzing was working with US Air force and he was facing many problems such as allocation of weapons to different war locations, military logistics, etc. Since available resources are limited (restricted), it was very crucial to allocate optimum number of weapons or logistics in order to fulfil the objective of winning the war.
To formulate Linear Programming Problem (LPP) for given statement type problems(numerical) is easy if we go through its Mathematical Model. General Mathematical Modelling of LP. As explained in the video, mathematical model of LP consists of the following