Transshipment Problem -LP Formulation | Solution
Вставка
- Опубліковано 9 лип 2024
- This video explains how to formulate and solve trans-shipment linear programming problems.
Solve Transshipment problem in Excel: • Solve Transshipment in...
Solve Transshipment problem in Excel 2: • Solve Transshipment in...
How to Solve LP in LINDO: • Solve LP using LINDO (...
00:00 - Introduction
00:41 - Transshipment network Model
01:44 - Decision Variables, Objective Function
02:24 - Constraints
04:16 - Balanced and Unbalanced Problems
04:49 - Shipping between any 2 nodes
05:54 - Capacitated Routes
06:40 - Unacceptable Routes
06:54 - Solution in LINDO
I'm taking a Graduate Quantitative Analysis class, and I'm filled with gratitude that I found your channel. You present your material with such clarity and it's so easy to understand. Thank you so much! Sending blessings from Upstate New York ⭐️🙏🌞
Thanks so much, Claudia, for taking time to make this generous donation.
That kind gesture means a lot to me.
Much appreciated.
🙏
Not gonna lie, I really love your videos!!! Personally, you are probably the best math teacher I know in the world. Thank you so much for uploading these videos, we appreciate it, sir!!!🙏
Thank you, sir! Very helpful.
Very Crisp and well explained!!
Thank you so much!
Thank you.
clear explanation thanks.
This was really helpful , Thank you😭😭😭😭😭😭😭😭🙏🙏🙏🙏🙏🙏
I hope i found your videos earlier in the semester, but I'll crush the finals!
Save time in my life best🎉❤
helpful.
Quick Question: In the video @5:03 --> when you add a connection between node 3 & node 6 to ship certain demand and add that to the constraints, shoudn't you add X36(units shipped form 3 to 6) * unit cost of shipping from node 3 to node 6 in the objective function as well?
Thanks for the amazing explanations!
You're very correct. The cost should be added to the objective function as well.
Thanks for this great video
You're welcome Gg
Thanks!
Thanks, Mo. I really appreciate the kind gesture.
Nice
Very explicit
Thanks so much for this.. please what do we do in a case where we have to ship from warehouse 4 and 5 to warehouse 4 and 5 before shipping to the final destination
If node 4 can ship to node 5, and node 4 can ship to node 5:
then for node 4,
X14 + X24 + X34 + X54 = X45 + X46 + X47 + X48
and for node 5,
X15 + X25 + X35 + X45 = X54 + X56 + X57 + X58
@@joshemman thank you soo much
Good video
One question, do the constraints cover supplier, demand, and transshipment?
Yes
love the video, could you make one solving it through excel solver? thank you
Sure. I will work on that.
ua-cam.com/video/5NdprD0Vi-k/v-deo.html
Thank you
Can you please help me out with which transport route will cost least and which cost most per trip
Cost least: Minimize
Cost most: Maximize
You talking about over all cost ...can you please help me out for per trip...single route which cost more or which cost less
@@hussainshaikh5992 Do you have distance information as well?
@joshemman what if the plants manufactured different types of products and every delivery zone had different demand for each product? how can i formulate that?
Than you have to define variables for each product type.
@@joshemman Thank you for the quick reply really appreciate it. But I still can't figure it out.Perhaps I didn't state my question clearly. Lets say that we have Plant A making product A, Plant B making product B and Plant C making product C. There are 3 warehouses and 3 Delivery Zones and Each Delivery Zone demands a certain amount of each product and the supply is equal to demand. In this case do I need to consider a different solving method (some new constraints maybe) or can I apply the things you do in your video without making any changes? I'm really not getting the difference between having a single product in different plants and having different products in each plant. (sorry for the long question😁)
@@oxygenabuser5446 Something like …
Plant: A, B, C
Warehouses: U, V, W
Delivery Zones: D, E, F
Plants:
AU + AV + AW = A’s Supply
BU + BV + BW = B’s Supply
CU + CV + CW = C’s Supply
Warehouse U:
AUD + AUE + AUF = AU
BUD + BUE + BUF = BU
CUD + CUE + CUF = CU
Similarly for V and W
Delivery Zone D:
AUD + AVD + AWD = A required at D
BUD + BVD + BWD = B required at D
CUD + CVD + CWD = C required at D
Similarly for E and F.
In the capacitated routes section, if it is written that no more than 40,000 units can be moved each week through node 4? Will the constraint be the same as X14+X24+X34
Any of those two will work. They will produce the same result.
Will the constraint of x14+x24+x34-x46-x47-x48 be totally ignored and then replaced with either of the one @siddhantsingh275 mentioned if it is written that no more than 40,000 units can be moved each week through node 4 ? or will either of the constraints @siddhantsingh275 mentioned be inputted along with x14+x24+x34-x46-x47-x48?
@@akinbodeolubunmi5010 If a node is truly a transshipment node, then it must give up whatever it receives; it can’t keep any.
Thus, you must still include x14+x24+x34-x46-x47-x48=0.