MANAGEMENT SCIENCE UNIT-5 | Degree 4th sem BBA management Science unit-5 full explanation💯✅

Added: 2026-05-31

[00:00:00]Hello dear students, welcome back to our YouTube channel Learn with Sahira. In this video, we are going to see the complete and clear explanation of unit number five theory from the subject management science, which is for degree fourth semester BBA students. Definitely watch the video till the very end and if you're new to our YouTube channel Learn with Sahira, subscribe it for more exam preparation videos. Students, one more important thing, I have already prepared I'm sure important question and answers notes for all subjects and languages of degree fourth semester. These notes are easy, simple, clear to understand and ready for quick exam preparation. If you want these notes, message me on my Instagram. My Instagram ID link is available in this video description.

[00:00:41]Just message me want notes along with your group and semester. I will be giving you the access to all the notes.

[00:00:46]But remember, these are paid notes. Yes, there is a small payment for the notes, but believe me, you're going to see excellent results with these notes. Only the students who want the notes should text me. And if you want to watch all explanation videos of this subject, do check out our playlist. Playlist link is also available in this video description. Without getting late, let us get started. Guys, from unit number five, question number one is define transportation problem. Explain the methods for finding initial solution of a transportation problem. First, let us try to understand a little about transportation problem. Guys, a transportation problem is a special type of linear programming problem, okay?

[00:01:24]Basically, it deals with transporting goods from different sources to different destinations and minimum possible cost. Basically, it will help the organization to decide how much quantity should be transported from which source to which destination and at the lowest transportation cost. Okay, this is important. For example, guys, a company have many factories and many warehouses. The transportation problem will help to decide the best shipping plan so that the goods will reach all the destinations at minimum cost, okay?

[00:01:59]I hope you understood.

[00:02:00]Now, let us try to understand the methods for finding initial solution.

[00:02:05]First, we have northwest corner method, NWC.

[00:02:09]Okay, northwest corner method. Guys, this is the simplest method we can say.

[00:02:15]In this method, allocation starts from the first cell located at the top left corner of the transportation table.

[00:02:22]Okay, you have to understand this that here, the allocation starts from first cell located at the top left corner of the transportation table, okay? We do have steps. First, it will start from the northwest corner and allocate the maximum possible quantity. It will reduce supply and demand accordingly.

[00:02:45]Then, it will move to the next row or column. And it will continue until all allocations are completed, guys.

[00:02:51]Basically, it is easy and simple to apply, but we have one disadvantage is that it does not consider transportation cost, okay? So, the solution may be not economical, we can say. So, this is northwest corner method, okay? From where the allocation will start? From first cell located from top left corner.

[00:03:11]You have to remember these steps. Then, we have least cost method, guys, LCM. In this method, allocation is made to the cell having the lowest transportation cost, okay? The main aim here is to reduce transportation expenses from the beginning itself. So, first, we will identify the cell with the minimum cost.

[00:03:31]Then, we will allocate the maximum possible quantity. Then, we will adjust supply and demand. Then, we will be selecting next lowest cost cell. And we will continue until all allocations are completed. So, usually, it provides better solution compared to this uh northwest corner method, okay? But it may still not give the optimal solution.

[00:03:53]Then we have VAM, guys.

[00:03:55]Vogel's approximation method, VAM. This is one of the best methods for finding an initial solution, we can say. It uses penalty values, okay, to make better allocation decisions. First, we will be calculating row and column penalties, okay? Then we will be selecting the row, or else we will be selecting the column with the highest penalty. After that, we will find the lowest to cost to cell in that particular row or column. Then we will allocate the maximum possible quantity, and we will repeat the process until all allocations are completed. The last point is same for all the methods, okay? So, you can write the same thing.

[00:04:35]Just try to understand, guys, and remember these steps. Easily you can do it. In my notes, I have given in detail explanations. If you want in detail explanation answers notes, message me on my Instagram, okay? These notes, from where I'm explaining you, these are short version notes which I have prepared in order to provide you free free explanation, but in detail explanation answers paid notes are already available. If you want them, message me on my Instagram. Question number two is explain the methods of converting a maximization assignment problem into minimization assignment problem. Guys, an assignment problem is a problem of assigning jobs, tasks, or duties to workers or machines in the best possible way, okay? The main objective here is to minimize the cost or maximize the profit. So, since the Hungarian method is mainly used for minimization problems, a maximization problem must first be converted into a minimization problem, okay? Jo bhi hai, pehle minimization mein convert karna hoga. So, yes, uh let us see the method of conversion. First, we need to identify the largest value, okay? First, find the highest profit value in in entire profit table. So, the value or this highest profit value it it is used for conversion, okay? For example, if the profit values are 10, 15, 20, 18, largest value comes out of 10, 15, 20, 18 which is obviously 20, right? So, we will be first identifying the largest value. Then, we will be subtracting each value from the largest value. Now, we have to subtract every value in the table from the largest value, okay? New value formula they call new value equals to largest value minus original value. So, this will convert the profit table into a cost table, okay?

[00:06:23]20 minus 20 zero, 20 minus 15 five, 20 minus 10 10. So, here the new values will become the entries of the minimization table. Then, we will be preparing new cost matrix, guys, after performing subtraction for all entries a new cost matrix is obtained, okay? So, this new table will represent a minimization problem. Now, the problem is ready to be solved using standard assignment methods.

[00:06:48]We need to apply Hungarian method once the conversion is completed the Hungarian method can be applied.

[00:06:55]Basically, guys, this method helps to find the optimal assignment with minimum cost, okay? And the final result obtained will also give the maximum profit solution to the original problem we can see. We have one simple example here. Suppose the largest profit value is 25.

[00:07:15]If the largest value is 20 and another value is 15, okay, guys? Sorry. If the largest value is 20 and another value is 15, what will be the new value, guys? 20 minus 15 it will be five. So, like that it is like assume if the largest value is 25 and another value is 18. 25 minus 18 seven. So, similarly all the values in the table will be converted like this, okay? And after conversion the new table will become minimization assignment problem, okay? I hope you understood. If not, try to understand it again by watching it again, okay?

[00:07:51]Then we have question number three.

[00:07:52]Explain the concept of queue and the characteristics of queues. Guys, first let us try to understand about a queue.

[00:07:59]Queue means a waiting line formed when people, customers, vehicles, or items wait for a service, okay? So, basically, a queue is created when the number of people needing service is more than the available service facility. In our daily lives also, guys, we can see the queues in banks, hospitals, supermarkets, railway stations, bus stations, and all, right? For example, when many customers come to a bank and only one cashier is available, customers must wait in a queue, right? Until they turn comes. So, queuing theory will study these waiting lines, and also it will help the organizations to provide better services, okay? Characteristics you can see. First, arrival pattern, guys.

[00:08:41]Arrival pattern refers to the way customers arrive for service. Like customers may arrive one by one, in groups, regularly, or randomly. So, understanding arrival patterns will help the organizations to plan their services effectively. And um service mechanism, guys. Service mechanism will explain how service is provided to customers. It will include number of service counters, uh speed of services, service procedure. For example, a bank may have one cashier or multiple cashiers to serve customers, right? So, service mechanism they take it may look so good. They are speed guy here or whatever. Queue discipline, guys. It means the rule which is used to decide who gets service first, okay? We have first come, first served. The customer who arrives first will get the service first. Then we have last come, first served. The customer who arrives last gets the service first. Then we have priority service. Some customers are given priority over others, okay? For example, emergency patients in a hospital are treated before normal patients, right? So, like that. Then queue length, guys. Queue length means the number of customers waiting in the line, okay? A long queue may indicate slow service or high customer arrivals, right? Waiting time. Waiting time is the time a customer spends in the queue before receiving the service, okay?

[00:10:00]Customers generally prefer shorter waiting time, right? Koi bhi zyada der queue wait karna chahega ya koi bhi zyada time queue invest karna chahega?

[00:10:08]Aajkal to time kam hai na, so definitely they will be hoping for a faster service. Then service time, guys.

[00:10:16]Service time means the time required to serve a customer. Like different customers may require different amounts of service time. So, faster service will reduce waiting and it will also improve the efficiency. System capacity, guys. It means maximum number of customers that can be accommodated in the system at one time, okay? Like some systems have limited capacity while others can handle a large number of customers. For example, a small clinic can accommodate fewer patients compared to a large hospital. So, like that capacity will also be checked. So, yes, this is about our queue and yes, what are these characteristics of queues? Now, let us see our last question, which is explain the queuing model and its applications for management. Guys, queuing model is a mathematical technique which is used to study waiting lines and service systems, right? Just now we have seen. Basically, it will help the managers to understand how customers arrive, how they wait, and how they receive the service, okay? And the main aim of queuing model is to reduce waiting time, improve service quality, balance service cost, and satisfy the customers. In simple words, a queuing model helps the organizations to manage waiting lines effectively, okay? Components arrival pattern, guys. Just now we have seen what is arrival pattern. Okay, all these we have already seen. We didn't see service channels, right?

[00:11:42]Whatever characteristics we have discussed now, that are only there in the components, okay? Service channels means, guys, it refers to the number of service points available. Like one cashier in a bank, single channel.

[00:11:55]Multiple cashiers multiple channels. So more service channels will generally reduce waiting time, okay? Then we have applications, guys. Applications come to banks. Banks use queuing model to decide the number of counters required. So basically this will help us to reduce customer waiting time and improve service, okay?

[00:12:13]Hospitals use queuing models to manage patient flow. Transportation services like airports, railway stations, bus terminals, they use queuing models to manage passengers effectively.

[00:12:26]Then retail stores, guys. They use queuing models to determine the required number of billing customers. So basically customers can complete shopping quickly. Telecommunication systems, queuing models helps to manage incoming calls and network traffic as well. Basically it will improve communication services and reduces congestion, okay? Then manufacturing industries, they use queuing models to manage machines, workers, production flow and all. Last but not least, customer networks. Customer Sorry, computer networks. Basically here computer systems use queuing model to control server traffic as well as process requests efficiently, okay? So yes, this is the complete explanation of unit number five. How was the explanation? Do let me know in the comment section. For in-detail explanation answers notes, you have to message me on my Instagram. Join our Telegram channel for more updates. Check out our playlist for all explanation videos. All the very best. Bye-bye.