Thanks for the comment Soldier. In the classroom we sometimes focus on the detailed understanding of the concept and the logic of the method. Here I have been functional. So if you link this to what your professor was teaching, maybe you will see more sense in his methods.
Thanks Raju. The appreciation, and the fact that you propose to use it in your class makes all the effort worth it. As of now, I have not put any examples for project situations and will do so in the future. Please do check the other videos also - especially the one on Assignment and Production Planning, they might be of use.
Thank you so much for this video. 11 years later and it perfectly covers the content covered in my 300 level college course. I'm approaching finals, and I appreciate the conciseness and simplicity of your explanations.
this legit taught me more than my lecturers did in a week. It took me 2 hrs looking through slides and notes and cannot find whats going on. but this 5min video made me understood everything. thank you so much!!!
I have spend hours trying to find a simple easy to understand solver video. Thank you very much because this is one of the best videos I have found. It took me only 5 mins to solve a problem .
It is precise at the point, no confusion, no any thing hard, even it very use full those who think LP can not learn. it is so easy to learn LP with SOLVER.
Very useful video! I attended a lecture on this and although I found it useful and interesting, I didn't actually grasp how to do it. I can now use solver with ease!! Thanks
I have A.D.D. and as a dyslectic i met great difficulties in everything about Solver - the university book, youtube videos, excel help...that, till i saw this video and not only solved the problem right away but also i understood the methodology. I have to thank you. You must be one fine Professor.
Thank you very much Ntina for leaving this message. I am glad the video could help you. Now with problems related to solver out of the way, Operations Research should be much more fun.
Thank you for sharing this video. It was helpful in reminding me how to use solver. With respect, I must say that I think your formulation is incorrect. I think that you need four decision variables (# of chairs made on M1, # of chairs made on M2, # of tables made on M1, and # of tables made on M2). If you do it this way, then the constraint on M1 being less than or equal to 200 hours is dependent only on what M1 produces and not on all of the chairs and tables produced by both machines. I solved it with these extra two decision variables and found a solution of 50 chairs from M1 and 80 tables from M2 (0 tables for M1 and 0 chairs from M2), which results in $4700 in profit. If you check the constraints, you'll see that this is a feasible solution. Again, thank you very much for making this video. It really was very helpful!
HI Ryan, thanks for the feedback. I should have been more clear in the video. I had intended to mention that the chairs and tables have to sequentially go through both machines. So, they first go to M1 and then to M2. With this we need only two constraints. If we assume that either of the machines can make both the products we would surely need four constraints.
I just wanted to thank you for this video it was very easy to get my head around as I was really struggling with a bigger problem then this and it helped me enormously. I am so very grateful I was just about to give up and submit my assignment without doing the question and I hope to do well at it now.
sir...just wondering...why the solver did not suggest we make any table since the question objective is to optimize the mix of chair and table?is there anything need to be adjusted in the solver so that both chair and table can be produced and at the same time maximize its profits?
+Farahin Hanani The solver always suggests ways to maximise the contribution. In this case, if you produce tables, your contribution is likely to come down. If you have to make tables, add it as a constraint. I think the third video in this series does this. Check it.
Very helpful lesson! I'm searching for a lecture in how to test a validation of consistency of any LP model construct and results. I would appreciate if you provide any helpful source. Many Thanks.
By contribution you mean the amount of money need to pay in order to produce table or chair ? also I am using 2010 Excel, in the solver options shall I change it from GRG Nonlinear to Simple LP ?
Maybe Ive missed a point, but how can the contribution be maximized when Machine 2 still has 150 available hours? Shouldnt Machine 1 produce 50 chairs and Machine 2 produce 80 tables?
Thanks for sharing this concern Marhau. In the case, the chairs and tables need both machines M1 and M2 and not either M1 or M2. So, even though M2 has slack capacity, we can;t produce more since M1 does not have slack capacity. Does this help?
The assumption here is that the viewer is convinced that the Linear Programming gives the best (optimum) solution. The video is just about the mechanics. Alternatively, it is possible to input different values of the decision variables (tables and chairs) and check if the contribution exceeds the value arrived at by MS Excel.
Piyush Sir, maybe I'm missing something. When I see that M2 can make a table or chair in the same 5 hours time, and table makes makes more money, then M2 should only make tables. 80 tables in 400 hours @ 5 hours each. Total contribution 3200. M1 is more efficient at chairs than tables. It makes 1.75 chairs in time it takes for 1 table. If table costs more than 1.75x of chair, then M1 should make tables as well, or else chairs. Since 40/30 = 1.33 < 1.75, M1 should make chairs. 50 chairs in 200 hours @ 4 hours each. Total contribution 1500. Grand total contribution 4700. Please correct if wrong. Or if I ended up looking at this in a non-linear way somehow. Thanks.
Tables and chairs needs to go through both M1 and M2 to be made. So, a product first goes to M1 and then to M2. If we assume that both the machines can individually make the products, your assertion is correct.
Great video! I just had a question, if we utilize the entire 400 hours on M2, we will get more contribution, but why didn't solver take this into consideration?
in this video or tutorial, could it be identified also as Computer solution since it uses MS Excel? or it simplified the problem using the excel but not actualy the Computer Solution for Linear Programming?? thanks..
Hello, I have a lot more complex problem than the one you showed me. I would be glad if you could help me out on this. Lets take an analogy of some Ores. a,b,c,d,e. These Ores have minerals A,B,C,D,E in them. For Example 500 Units of a will have 100 units of A and 50 Units of B and so on. In the end I know how much minerals A,B,C,D,E I want. And I wan't to know what ores I should obtain to get those minerals and how many units of those ores. How would I calculate that?
HI Sarthak, these videos are an introduction to using Excel Solver for LP and thats why simple problems have been used. For your problem, I guess minimising the cost or Ores a,b,...would be the objective. The decision variables would be the units of each of the Ores to purchase. The constraints would be to have the minimum or maximum units or minerals. So, for example Each Ore 'a' has 0.2 units of 'A', and each Ore 'b' has 0.3 units of A then 0.2a+0.3b is the units of the Mineral 'A'. This you have to compare with the condition in the problem for the Mineral A.
Schurman Orchards has apple trees and cherry trees. The apples and cherries that are grown at Schurman Orchards are used to produce both apple cider and cherry cider. Weekly sales commitments by the owners of Schurman Orchards require at least 50 gallons of apple cider and at least 20 gallons of cherry cider. Schurman Orchards has the weekly capacity to produce at least 100 gallons of apple cider or at least 50 gallons of cherry cider or any linear combination of apple cider and cherry cider. Each gallon of apple cider cost Schurman Orchards $4; each gallon of cherry cider cost $6. a. Set up the appropriate linear program b. Solve the result of (a) using the simplex algorithm.
Create a constraint for the mix ratio. Say the mix ratio is 1:r, where for every 1 chair we need r tables. If c is the number of chairs made and t is the number of tables made then cr = t, or cr - t = 0. Does this help?
+Gabriela Hernandez Are you referring to the graphical methods for solving an LP? I don't think we can use these tables to create the graphs. But, I am sure there would be some software (possibly free) that would allow you to apply the graphical method.
When I saw that the video was only 5 minutes long, I thought that I had probably googled the wrong name for my problem. Turns out this isn't nearly as complicated as I thought after my buffoon of a teacher tried to explain it. Thanks so much!
Thanks Piyush - very clearly explained . I am going to use it in a class on project management .Do you have LP examples for resource optimization - project situations . Thanks once again - appreciate yr effort .
We need both M1 and M2 to make the tables and chairs. It is as if M1 cuts the wooden pieces and M2 joins them. So, if we have excess capacity in M2, that excess is wasted and is unusable.
hi sir.. i was just wondering cause when while we tried that at school, there exist answer reports everytime we solve it though solve.. how am i suppose to do that? Btw, you lecture is great.
Hi am not sure how its working , if we are making 50 chairs and utilizing all 200 hours from M1. Then number of chairs made by M1 is 200/4 which is 50 chairs , i.e. OP of LP. Then what does the 250 hours from M2 contributes to ? Or does it mean 50 chairs from both M1 and M2 if that the case why not use all 400 hours from M2 ??
Hi Amir, the chairs need both M1 and M2, and not either M1 or M2. Imagine that M1 cuts wood and M2 joins the cut wood. Does this help clear the confusion?
Great explanation but why is the answer only 50 chairs? I get it on Machine M1 has to be less than 200 hours, but on M2 it has to be 400 hours. Wouldnt the solution be to be closer to capacity on Machine M2?
Piyush Shah is there a little error? You are not maximizing the available capacity of machine M2? The constraint of this whole maximizing function will be always the machine with the lowest available hours and I believe we should separate those two constraints.
Great explanation of how to use it, but I don't think solver has truly optimised the contribution - you still have 150 hrs left to use on M2. If you think about the numbers alone, it's more efficient to make chairs on M1 (contribution per hour of tables is 5.7 rupees/hr vs 7.5 rupees/hr for chair), however it's more efficient to use machine m2 to make tables (tables 8 rupees/hr vs chairs 6 rupees/hr). Thought of in another way, if it takes M2 5 hours to make a table or a chair, and a table gives a greater contribution, you would pick tablets to make.
Very good observation. The next and all other videos in this series uses sumproduct. However here I wanted to make the basic mechanism clear and that is why I did not use the sumproduct formula. Have a look at the other videos and let me know,
If maximizing the profit (contribution) is the aim, there is no reason not max out both machines at 50 and 80 chairs each, achieving a contribution of 5.2k while staying at their maximum allowed capacity...right?
Hi Kay, you would be perfectly right if the tables or chairs could be either made on Machine1 or on Machine 2. Here, as I say in the beginning the tables and chairs need both the machines. So, they have to be first processed through M1 and after that they have to be processes through M2. Does the problem now make sense?
Hello sir,i saw your solver video it was excelent,can you please help us with shortest route problem solver,if you can do a video i would really appreciate it.Thakyou sir
Sir, I have different combination of crops and the total cost, gross returns, net returns and also I have input used and yield of those crops per acre. But I don't know what could be the maximum capacity of the land as no body could know it. Can I use linear programming to check what is the optimum farming pattern? If yes how? Please share your contact number, sir. I watched this video more than 10 times to understand how I could use it, but I am unable to find the optimum combination. Could you suggest any other methods to solve my problem. How I could prove with analysis?
Piyush Shah yeah yeah sure! i hav the cost of giving an add in 3 newspapers.. 1)regional newspaper 2)hindi 3) english... now i also have the cost of giving it on front page and the last page. i need to find out which one would be efficient using LPP
Akanksha Chouhan Define efficiency and that becomes your objective function. Since you control the type and position of ads that becomes your decision variables (english front, english back, hindi front, hindi back, etc). The constraints would be the cash available, minimum ads of certain type necessary or some viewership requirements.
Thanks... is their a chance to show us the shortest way problem on excel solver for example 1to2= 20 km, 1to4=10km, 2to3=20km, 2to5=50km, 3to5=10km, 4to2=20km, 4to5=50km and 5to3=20km... Please i need your help:)...
Hello. Thanks for the video. You had made mistake in the problem definition. The clearest thing that proves this, that there are free 150 hours on machine M2, so why not to use them to increase contribution. The true answer will be 50 chairs on M1 and 80 tables on M2 to get 4700 Rs. contribution. Consider this equation system: T1*7+C1*4
Hi Shady, the idea here is that both products need both the machines. So, to produce a table, it has to first go to M1, get processed for 7 hours and then go to M2 and get processed for 5 hours. If I use your product mix (50 chairs and 80 tables) we would exceed our capacity. So 50 chairs will need 200 (50*4) hours on M1 and 250 (50*5) hours on M2. Similarly, 80 tables would need 560 (80*7) hours on M1 and 400 (80*5) hours on M2. Combining both we would need 760 hours (200+560) hours on M1 and 650 hours (400+250) on M2. This is beyond our capacity of 200 hours on M1 and 400 hours on M2 and hence not feasible. I hope I was able to explain the logic of the problem. Per se, sometimes we are forced to have some idle capacities as our manufacturing facilities are not balanced.
sir thanks for the very useful video... sir can you upload a video of linear programming of variables having objective function like that.... 4(X1+X2+X3)+2(Y1+Y2+Y3), where X=X1+X2+X3 and Y=Y1+Y2+Y3
Can you solve this for us: A company makes two products (X and Y) using two machines (A and B). Each unit of X that is produced requires 50 minutes processing time on machine A and 30 minutes processing time on machine B. Each unit of Y that is produced requires 24 minutes processing time on machine A and 33 minutes processing time on machine B. At the start of the current week there are 30 units of X and 90 units of Y in stock. Available processing time on machine A is forecast to be 40 hours and on machine B is forecast to be 35 hours. The demand for X in the current week is forecast to be 75 units and for Y is forecast to be 95 units. Company policy is to maximise the combined sum of the units of X and the units of Y in stock at the end of the week. -Formulate the problem of deciding how much of each product to make in the current week as a linear program. -Solve this linear program graphically. Thank you
Interesting problem. It is very similar to the problem I have solved with a few changes - 1. Objective function is to maximise total production (X + Y) and not to maximise profits. There are two additional constraints for minimum production of X and Y so as to not have stockouts. This should solve it.
This 5 minute video just taught me more than my professor could in 40 minutes! Just save me, thanks!
Thanks for the comment Soldier. In the classroom we sometimes focus on the detailed understanding of the concept and the logic of the method. Here I have been functional. So if you link this to what your professor was teaching, maybe you will see more sense in his methods.
Very true!
@@piyushashah1 hello can you teach me
Thanks Raju. The appreciation, and the fact that you propose to use it in your class makes all the effort worth it. As of now, I have not put any examples for project situations and will do so in the future. Please do check the other videos also - especially the one on Assignment and Production Planning, they might be of use.
This just felt like a blessed video. Entire complication summarized beautifully in one video. Very smooth, clear and wonderfully explained!!
Thank you so much for this video. 11 years later and it perfectly covers the content covered in my 300 level college course. I'm approaching finals, and I appreciate the conciseness and simplicity of your explanations.
Excellent tutorial. Crisp and to the point. Did not waste even a single second and every second had useful content.
Attention all producers of youtube video tutorials. THIS is how it should be done. Short and effective. Very nice work, my friend. Thank you!
Thank you for this wonderful comment. Do have a look at the other videos in this series as well.
this legit taught me more than my lecturers did in a week. It took me 2 hrs looking through slides and notes and cannot find whats going on. but this 5min video made me understood everything. thank you so much!!!
I have spend hours trying to find a simple easy to understand solver video. Thank you very much because this is one of the best videos I have found. It took me only 5 mins to solve a problem .
It is precise at the point, no confusion, no any thing hard,
even it very use full those who think LP can not learn.
it is so easy to learn LP with SOLVER.
Very useful video. Straight to the point, with all the emphasis being directed toward the subject matter. Professionally done and much appreciated.
After 2 weeks of being lost on this topic, you taught me how to do it in 10 minutes. Thank you!
Very useful video! I attended a lecture on this and although I found it useful and interesting, I didn't actually grasp how to do it. I can now use solver with ease!! Thanks
Thanks for leaving the comment. Did you check my other solver videos? Have a look, they might just make using solver even more easier.
Thank you sir , revising this before my business maths practical
I have A.D.D. and as a dyslectic i met great difficulties in everything about Solver - the university book, youtube videos, excel help...that, till i saw this video and not only solved the problem right away but also i understood the methodology. I have to thank you. You must be one fine Professor.
Thank you very much Ntina for leaving this message. I am glad the video could help you. Now with problems related to solver out of the way, Operations Research should be much more fun.
Thank you for sharing this video. It was helpful in reminding me how to use solver.
With respect, I must say that I think your formulation is incorrect. I think that you need four decision variables (# of chairs made on M1, # of chairs made on M2, # of tables made on M1, and # of tables made on M2). If you do it this way, then the constraint on M1 being less than or equal to 200 hours is dependent only on what M1 produces and not on all of the chairs and tables produced by both machines. I solved it with these extra two decision variables and found a solution of 50 chairs from M1 and 80 tables from M2 (0 tables for M1 and 0 chairs from M2), which results in $4700 in profit. If you check the constraints, you'll see that this is a feasible solution.
Again, thank you very much for making this video. It really was very helpful!
HI Ryan, thanks for the feedback. I should have been more clear in the video. I had intended to mention that the chairs and tables have to sequentially go through both machines. So, they first go to M1 and then to M2. With this we need only two constraints. If we assume that either of the machines can make both the products we would surely need four constraints.
I have the same solution.
That is what you did say, I understood it fine and agree with your solution@@piyushashah1
This video really helped my understanding of formulation of linear problems. Thank you for the knowledge!
Thanks for the comment. I'm happy that the video was helpful for you.
I just wanted to thank you for this video it was very easy to get my head around as I was really struggling with a bigger problem then this and it helped me enormously. I am so very grateful I was just about to give up and submit my assignment without doing the question and I hope to do well at it now.
HI Lakshit, thanks for the feedback. Happy that the video helped you. Do have a look at the other videos as well
Sir, the newer excel version asks to set an objective. What should that be regarding this problem?
sir...just wondering...why the solver did not suggest we make any table since the question objective is to optimize the mix of chair and table?is there anything need to be adjusted in the solver so that both chair and table can be produced and at the same time maximize its profits?
+Farahin Hanani The solver always suggests ways to maximise the contribution. In this case, if you produce tables, your contribution is likely to come down. If you have to make tables, add it as a constraint. I think the third video in this series does this. Check it.
Very helpful lesson! I'm searching for a lecture in how to test a validation of consistency of any LP model construct and results. I would appreciate if you provide any helpful source.
Many Thanks.
By contribution you mean the amount of money need to pay in order to produce table or chair ? also I am using 2010 Excel, in the solver options shall I change it from GRG Nonlinear to Simple LP ?
Hani Albarni Contribution is the subtraction of variable cost from selling price. In 2010 Excel, use Simplex LP.
Maybe Ive missed a point, but how can the contribution be maximized when Machine 2 still has 150 available hours? Shouldnt Machine 1 produce 50 chairs and Machine 2 produce 80 tables?
Thanks for sharing this concern Marhau. In the case, the chairs and tables need both machines M1 and M2 and not either M1 or M2. So, even though M2 has slack capacity, we can;t produce more since M1 does not have slack capacity. Does this help?
Absolutely great video. It's nice having a simple way to check my answers in Linear Programming.
The assumption here is that the viewer is convinced that the Linear Programming gives the best (optimum) solution. The video is just about the mechanics. Alternatively, it is possible to input different values of the decision variables (tables and chairs) and check if the contribution exceeds the value arrived at by MS Excel.
With this simple video you just made me completely understand this part. Thank you very much!
Best tutorial on excel solver with LP problems there is!
+VonNeumannOperator Thanks a lot for leaving the comment.
Thank you sir....it is really helpful
Thanks for uploading the video! I'm learning this in class using a bigger problem so it's nice to see the breakdown on a simple one first.
Thanks for leaving a comment Peterson.
A very clear (in its content) and precise video. Keep it up. Thank You for explaining the use of Excel solver in such a simple way.
Piyush Sir, maybe I'm missing something. When I see that M2 can make a table or chair in the same 5 hours time, and table makes makes more money, then M2 should only make tables. 80 tables in 400 hours @ 5 hours each. Total contribution 3200.
M1 is more efficient at chairs than tables. It makes 1.75 chairs in time it takes for 1 table. If table costs more than 1.75x of chair, then M1 should make tables as well, or else chairs. Since 40/30 = 1.33 < 1.75, M1 should make chairs. 50 chairs in 200 hours @ 4 hours each. Total contribution 1500.
Grand total contribution 4700. Please correct if wrong. Or if I ended up looking at this in a non-linear way somehow. Thanks.
Tables and chairs needs to go through both M1 and M2 to be made. So, a product first goes to M1 and then to M2. If we assume that both the machines can individually make the products, your assertion is correct.
Piyush Shah Should have focused on M1 'and' M2. Thanks :)
Thanks Piyush, you are really clear in your explanation of how do solve problems!
Thank you soooo much. I was struggling with this topic in school. You explained it so simply.
Great video! I just had a question, if we utilize the entire 400 hours on M2, we will get more contribution, but why didn't solver take this into consideration?
You can't use entire capacity on M2 as M1 capacity is limited. A process needs both M1 and M2 together
Thank YOU LRJ. It was nice of you to leave this message.
in this video or tutorial, could it be identified also as Computer solution since it uses MS Excel? or it simplified the problem using the excel but not actualy the Computer Solution for Linear Programming?? thanks..
I would say it is an MS Excel based tutorial. The problem is solved using the Solver addin of MS Excel. Did you find the video useful?
Nice video Sir I used to be your student really misss your lectures......I don't think anyone can teach Operations Management the way u taught us!!
Thanks a lot for the comment. Really appreciate it. .Where did I teach you?? Sorry can't make out from your screen name here.
thank you soo much...u just help me finished my final assignment...i don't have any idea to solve the question before i saw this video
Hello, I have a lot more complex problem than the one you showed me. I would be glad if you could help me out on this. Lets take an analogy of some Ores. a,b,c,d,e. These Ores have minerals A,B,C,D,E in them. For Example 500 Units of a will have 100 units of A and 50 Units of B and so on. In the end I know how much minerals A,B,C,D,E I want. And I wan't to know what ores I should obtain to get those minerals and how many units of those ores. How would I calculate that?
HI Sarthak, these videos are an introduction to using Excel Solver for LP and thats why simple problems have been used. For your problem, I guess minimising the cost or Ores a,b,...would be the objective. The decision variables would be the units of each of the Ores to purchase. The constraints would be to have the minimum or maximum units or minerals. So, for example Each Ore 'a' has 0.2 units of 'A', and each Ore 'b' has 0.3 units of A then 0.2a+0.3b is the units of the Mineral 'A'. This you have to compare with the condition in the problem for the Mineral A.
A nice explanation than any video I have seen.
Very helpful, thank you.
Thank you very much. This really helped my friends and I. A tip: you may advise people how to download solver
+rose muthee Thanks for the tip Rose. I will try to include it in this video itself.
+Piyush Shah sir i have a problem about lp and i couldnt solve it can u help me
What is it?
Schurman Orchards has apple trees and cherry trees. The apples and cherries that are grown at Schurman Orchards are used to produce both apple cider and cherry cider. Weekly sales commitments by the owners of Schurman Orchards require at least 50 gallons of apple cider and at least 20 gallons of cherry cider. Schurman Orchards has the weekly capacity to produce at least 100 gallons of apple cider or at least 50 gallons of cherry cider or any linear combination of apple cider and cherry cider. Each gallon of apple cider cost Schurman Orchards $4; each gallon of cherry cider cost $6.
a. Set up the appropriate linear program
b. Solve the result of (a) using the simplex algorithm.
how to compute if its required to make both tables and chair and no binding on qty ? optimum mix of both.. tx for sharing
Create a constraint for the mix ratio. Say the mix ratio is 1:r, where for every 1 chair we need r tables. If c is the number of chairs made and t is the number of tables made then cr = t, or cr - t = 0. Does this help?
How does one show the results graphically from the tables you created in this video?
+Gabriela Hernandez Are you referring to the graphical methods for solving an LP? I don't think we can use these tables to create the graphs. But, I am sure there would be some software (possibly free) that would allow you to apply the graphical method.
+Piyush Shah i just wondering if u do an assignment for student. email me at mariamawiw@gmail.com
Tatek Dinku No I Don't Tatek. Best wishes.
you are the best sir, may god bless you
When I saw that the video was only 5 minutes long, I thought that I had probably googled the wrong name for my problem. Turns out this isn't nearly as complicated as I thought after my buffoon of a teacher tried to explain it. Thanks so much!
This has been very helpful. It was clear to follow along. Thank you very much!
Thanks Piyush - very clearly explained . I am going to use it in a class on project management .Do you have LP examples for resource optimization - project situations . Thanks once again - appreciate yr effort .
It was a simple and easy to understand beginner. Thank.
Thank you for viewing the video and leaving comments. Please do go through other videos on LP, they should help.
can't we use remaining number of machine hours of M2 to produce more tables and chairs
We need both M1 and M2 to make the tables and chairs. It is as if M1 cuts the wooden pieces and M2 joins them. So, if we have excess capacity in M2, that excess is wasted and is unusable.
hi sir.. i was just wondering cause when while we tried that at school, there exist answer reports everytime we solve it though solve.. how am i suppose to do that? Btw, you lecture is great.
Good job Piyush!! We have the same question here in Canada except it's in CAD.
+Juhi K. Thanks for leaving the comment Juhi. What is CAD? Is it designing software you are referring to?
+Re Ma Opps...I hope with technology we can create videos so that they speak the currency in the native units.
Hi am not sure how its working , if we are making 50 chairs and utilizing all 200 hours from M1. Then number of chairs made by M1 is 200/4 which is 50 chairs , i.e. OP of LP. Then what does the 250 hours from M2 contributes to ? Or does it mean 50 chairs from both M1 and M2 if that the case why not use all 400 hours from M2 ??
Hi Amir, the chairs need both M1 and M2, and not either M1 or M2. Imagine that M1 cuts wood and M2 joins the cut wood. Does this help clear the confusion?
@@piyushashah1 Thanks for the Clarification, You got a subscriber :)
Couldn't have done this better. THANKS !
+barissimo111 Thanks a lot for leaving the comment. Did you see the other videos in this series? They may also be helpful.
+Piyush Shah yes the videos are great thank you ! Subscribed :D
Piyush, its simple and made me so clear on the solver. Thanks a lot. A good start for solver...
Hello Piyushji
Can you please help me to in this I am struggling in my assignment of Modeling the supply chain.
Great video, very sinple to understand and gets to the point, helped a lot with my schoolwork, found it just when I was about to give up lol, ty! :)
Thank you, you made it easier.
Glad the video help, and thanks for leaving this comment.
Great explanation. Thank you, this helped me.
Great explanation but why is the answer only 50 chairs? I get it on Machine M1 has to be less than 200 hours, but on M2 it has to be 400 hours. Wouldnt the solution be to be closer to capacity on Machine M2?
It's because the chairs and tables need both M1 and M2 and not M1 or M2.
Piyush Sir, you also need to add that the number of tables and chairs should be non negative. Is my understanding wrong?
Correct Manisha. At around @4:44 I talk about non-negativity.
Piyush Shah is there a little error? You are not maximizing the available capacity of machine M2? The constraint of this whole maximizing function will be always the machine with the lowest available hours and I believe we should separate those two constraints.
this is awsome piyush i understood compeltely....
i have my xam tomorrow.... so thanx a ton for this one... really appreciate the effort
Great explanation of how to use it, but I don't think solver has truly optimised the contribution - you still have 150 hrs left to use on M2. If you think about the numbers alone, it's more efficient to make chairs on M1 (contribution per hour of tables is 5.7 rupees/hr vs 7.5 rupees/hr for chair), however it's more efficient to use machine m2 to make tables (tables 8 rupees/hr vs chairs 6 rupees/hr). Thought of in another way, if it takes M2 5 hours to make a table or a chair, and a table gives a greater contribution, you would pick tablets to make.
Oh yep, I just scrolled further down in the comments. The furniture has to go through both machines, not just one. Thanks @Shrujanam Syama
I'm having more fun solving operation research problems lol Thanks for the help again.
OR is supposed to be fun, enjoy it.
My concept got cleared . Huge thanks .
thank you
Good job Kartik!
This was a perfectly clear explanation, thank you!
God bless you and your wisdom! Thank you!!!
Thank you very much, Nice work. Simple and direct!
Not sure why you did not use formula (sumproduct) instead of multiply add and multiply.
Very good observation. The next and all other videos in this series uses sumproduct. However here I wanted to make the basic mechanism clear and that is why I did not use the sumproduct formula. Have a look at the other videos and let me know,
Excellent explanation and very clear! Thank you
Thank you. A clear explanation and a great video o refresh my memories.
Thank you for the great tutorial solving linear problem using Excel solver is the best for me :::::)
Easy and quick.
Thank you very much for this beneficial and simple explanation
Great video! Big exam coming up, appreciate this a lot
If maximizing the profit (contribution) is the aim, there is no reason not max out both machines at 50 and 80 chairs each, achieving a contribution of 5.2k while staying at their maximum allowed capacity...right?
Hi Kay, you would be perfectly right if the tables or chairs could be either made on Machine1 or on Machine 2. Here, as I say in the beginning the tables and chairs need both the machines. So, they have to be first processed through M1 and after that they have to be processes through M2. Does the problem now make sense?
I don't have analytic solver in excel. can anyone tell me how to get it?
thank you, you explanations are very helpful.
Hello sir,i saw your solver video it was excelent,can you please help us with shortest route problem solver,if you can do a video i would really appreciate it.Thakyou sir
HI Abhi, will surely try to host that in the next 10 days.
Sir, I have different combination of crops and the total cost, gross returns, net returns and also I have input used and yield of those crops per acre. But I don't know what could be the maximum capacity of the land as no body could know it. Can I use linear programming to check what is the optimum farming pattern? If yes how? Please share your contact number, sir. I watched this video more than 10 times to understand how I could use it, but I am unable to find the optimum combination. Could you suggest any other methods to solve my problem. How I could prove with analysis?
message me on piyushashah@gmail.com
Thank you, sir. I have emailed you
Very well explained.
HII PIYUSH I NEED TO APPLY LPP FOR MY RPOJECT TO FIND THE EFFICINECY .. CAN U HELP ME WITH THE SAME?
Akanksha Chouhan Hi Akankska, I won't solve it for you, but will surely try to help you with hints. Let me know what your project is about.
Piyush Shah yeah yeah sure!
i hav the cost of giving an add in 3 newspapers.. 1)regional newspaper 2)hindi 3) english... now i also have the cost of giving it on front page and the last page. i need to find out which one would be efficient using LPP
Akanksha Chouhan Define efficiency and that becomes your objective function. Since you control the type and position of ads that becomes your decision variables (english front, english back, hindi front, hindi back, etc). The constraints would be the cash available, minimum ads of certain type necessary or some viewership requirements.
Great video. Thanks!
Sir i have a request,can you do it by tomorrow?or if you can give me some links to learn that,it would be helpful!
Thanks...
is their a chance to show us the shortest way problem on excel solver
for example 1to2= 20 km, 1to4=10km, 2to3=20km, 2to5=50km, 3to5=10km, 4to2=20km, 4to5=50km and 5to3=20km... Please i need your help:)...
Hi Sir, I have an assignment similar to this. I am struggling with Linear programming and would appreciate it if you can help me. thanks
Hi Omar, try it yourself and let me see what you have done. Will surely try to help you after that.
Thanks. This is really helpful. Two thumbs up!
Many thanks to you.. it is very useful and helped me during my study :)
I have a query regarding my problem, can you help me find out the solution?
Post it here Abhishek. I will not solve it for you, but will try to give you hints.
@@piyushashah1 yes that's enough for me...
@@abhiseksahoo2755 did you post your question?
THANK YOU!!! This helped me tremendously!
Hello. Thanks for the video. You had made mistake in the problem definition. The clearest thing that proves this, that there are free 150 hours on machine M2, so why not to use them to increase contribution. The true answer will be 50 chairs on M1 and 80 tables on M2 to get 4700 Rs. contribution. Consider this equation system:
T1*7+C1*4
Hi Shady, the idea here is that both products need both the machines. So, to produce a table, it has to first go to M1, get processed for 7 hours and then go to M2 and get processed for 5 hours.
If I use your product mix (50 chairs and 80 tables) we would exceed our capacity. So 50 chairs will need 200 (50*4) hours on M1 and 250 (50*5) hours on M2. Similarly, 80 tables would need 560 (80*7) hours on M1 and 400 (80*5) hours on M2. Combining both we would need 760 hours (200+560) hours on M1 and 650 hours (400+250) on M2. This is beyond our capacity of 200 hours on M1 and 400 hours on M2 and hence not feasible. I hope I was able to explain the logic of the problem.
Per se, sometimes we are forced to have some idle capacities as our manufacturing facilities are not balanced.
thank you so much sir. Now I will get a good grade on my test !
thank you so much! you've saved my day
sir thanks for the very useful video... sir can you upload a video of linear programming of variables having objective function like that.... 4(X1+X2+X3)+2(Y1+Y2+Y3), where X=X1+X2+X3 and Y=Y1+Y2+Y3
This helped my out a lot! Thank you so much!
Very helpful video, thanks!!
Awesome vid. Thank you.
This was a great help, thank you.
Can you solve this for us: A company makes two products (X and Y) using two machines (A and B). Each unit of X that is produced requires 50 minutes processing time on machine A and 30 minutes processing time on machine B. Each unit of Y that is produced requires 24 minutes processing time on machine A and 33 minutes processing time on machine B.
At the start of the current week there are 30 units of X and 90 units of Y in stock. Available processing time on machine A is forecast to be 40 hours and on machine B is forecast to be 35 hours.
The demand for X in the current week is forecast to be 75 units and for Y is forecast to be 95 units. Company policy is to maximise the combined sum of the units of X and the units of Y in stock at the end of the week.
-Formulate the problem of deciding how much of each product to make in the current week as a linear program.
-Solve this linear program graphically.
Thank you
Interesting problem. It is very similar to the problem I have solved with a few changes - 1. Objective function is to maximise total production (X + Y) and not to maximise profits. There are two additional constraints for minimum production of X and Y so as to not have stockouts. This should solve it.
Thanks a lot Balaji. Other videos for this topic have also been hosted by me. Pls do have a look.