- Видео 210
- Просмотров 633 506
dididedi
Добавлен 22 июл 2010
I learn, I share. I share, I learn.
Видео
1.3.c M/M/1 Example: Tool Center
Просмотров 44День назад
Queuing Theory: M/M/1/GD/∞/∞ Notations: λ = average number of arrivals entering the system per unit time [arrival rate] μ = average number of service completions per unit time [service rate] L = average number of customers present in the queuing system Lq = average number of customers waiting in line Ls = average number of customers in service W = average time a customer spends in the system Wq...
1.3b M/M/1 Example: Service Station
Просмотров 48День назад
Queuing Theory: M/M/1/GD/∞/∞ Notations: λ = average number of arrivals entering the system per unit time [arrival rate] μ = average number of service completions per unit time [service rate] L = average number of customers present in the queuing system Lq = average number of customers waiting in line Ls = average number of customers in service W = average time a customer spends in the system Wq...
1.3a M/M/1 Example: Drive-in Banking
Просмотров 43День назад
Queuing Theory: M/M/1/GD/∞/∞ Notations: λ = average number of arrivals entering the system per unit time [arrival rate] μ = average number of service completions per unit time [service rate] L = average number of customers present in the queuing system Lq = average number of customers waiting in line Ls = average number of customers in service W = average time a customer spends in the system Wq...
1.2 M/M/1: Deriving L, Lq, Ls and W, Wq, Ws
Просмотров 63День назад
Queuing Theory: M/M/1/GD/∞/∞ Notations: λ = average number of arrivals entering the system per unit time [arrival rate] μ = average number of service completions per unit time [service rate] L = average number of customers present in the queuing system Lq = average number of customers waiting in line Ls = average number of customers in service W = average time a customer spends in the system Wq...
![0.5 Birth-Death Process: Example [Queuing Theory]](http://i.ytimg.com/vi/UNaeYj_7GAs/mqdefault.jpg)
0.5 Birth-Death Process: Example [Queuing Theory]
Просмотров 53День назад
0.5 Birth-Death Process: Example [Queuing Theory]
![0.4 Birth-Death Process for Deriving Steady-state Probabilities [Queuing Theory]](http://i.ytimg.com/vi/VIkVp2l1jpE/mqdefault.jpg)
0.4 Birth-Death Process for Deriving Steady-state Probabilities [Queuing Theory]
Просмотров 85День назад
0.4 Birth-Death Process for Deriving Steady-state Probabilities [Queuing Theory]
![0.2 Modeling Arrival & Service Processes [Queuing Theory]](/img/1.gif)
0.2 Modeling Arrival & Service Processes [Queuing Theory]
Просмотров 8914 дней назад
0.2 Modeling Arrival & Service Processes [Queuing Theory]
0.3 Kendall-Lee Notation [Queuing Theory]
Просмотров 5314 дней назад
0.3 Kendall-Lee Notation [Queuing Theory]
0.1 Queuing Terminology [Queuing Theory]
Просмотров 15814 дней назад
0.1 Queuing Terminology [Queuing Theory]
Logistic Regression 3: Gradient Descent
Просмотров 1686 месяцев назад
Logistic Regression 3: Gradient Descent
Logistic Regression 4: Deriving Gradients
Просмотров 726 месяцев назад
Logistic Regression 4: Deriving Gradients
Logistic Regression 2: Loss Function
Просмотров 1416 месяцев назад
Logistic Regression 2: Loss Function
Logistic Regression 1: How It Works (Sigmoid)
Просмотров 1656 месяцев назад
Logistic Regression 1: How It Works (Sigmoid)
Simple Linear Regression (Least Square Estimates)
Просмотров 1216 месяцев назад
Simple Linear Regression (Least Square Estimates)
Data Mining/Machine Learning: Train & Test Data Sets, Cross-Validation
Просмотров 1438 месяцев назад
Data Mining/Machine Learning: Train & Test Data Sets, Cross-Validation
Performance Evaluation: Confusion Matrix, Accuracy, Precision, Recall, F1-score
Просмотров 1408 месяцев назад
Performance Evaluation: Confusion Matrix, Accuracy, Precision, Recall, F1-score
Supervised & Unsupervised Learning in Data Mining/Machine Learning
Просмотров 1378 месяцев назад
Supervised & Unsupervised Learning in Data Mining/Machine Learning
Data Mining/Machine Learning: Overview
Просмотров 2668 месяцев назад
Data Mining/Machine Learning: Overview
NLP.3 Solving One Variable NLP (Nonlinear Programming)
Просмотров 705Год назад
NLP.3 Solving One Variable NLP (Nonlinear Programming)
NLP.2c Hessian Matrix, Principal Minors (Nonlinear Programming)
Просмотров 2,8 тыс.Год назад
NLP.2c Hessian Matrix, Principal Minors (Nonlinear Programming)
NLP.2b Convex vs. Concave Functions (Nonlinear Programming)
Просмотров 988Год назад
NLP.2b Convex vs. Concave Functions (Nonlinear Programming)
numpy Package in Python (Introduction)
Просмотров 5663 года назад
numpy Package in Python (Introduction)
Functions in Computer Programming (Part 2/2)
Просмотров 5783 года назад
Functions in Computer Programming (Part 2/2)
Functions in Computer Programming (Part 1/2)
Просмотров 7423 года назад
Functions in Computer Programming (Part 1/2)
Week7.2 Assignment Problems (Hungarian Method)
Просмотров 2,7 тыс.3 года назад
Week7.2 Assignment Problems (Hungarian Method)
Week7.1 Sensitivity Analysis (Transportation Problems)
Просмотров 8 тыс.3 года назад
Week7.1 Sensitivity Analysis (Transportation Problems)
i love you didi <3
Thank you! <3
Thanks so much!
@@sherminkiller You're welcome! Hope you enjoy learning Revised Simplex & OR in general.
METU IE students sending their loves to you man. You are our best friend during our midterms and finals <3
Hello, thank you for the appreciation for my videos, I am very greateful. Wishing METU IE students all the best for the Midterm & Final exams. You can do it, guys!
viewers: 98 percent: METU IE students 2 percent: channel owner 👑 thank you for uploading just in time before the finals!
@@BerkayYÜKSEL-b1n Hello! When is the final exam for Queuing Theory at METU IE? I've still got some materials that I'd like to cover, hopefully I could do it before your exam. Anyway, good luck and thank you!
@@coverCell We have the exam on the 6th of January, it will be much appreciated if you can cover the rest until then.Thanks in advance!
METU IE students are grateful to you !!!!!!!!
@@ahmetselimyldrm7044 Thank you for your appreciation! It has motivated me to create the videos. Best wishes to all METU IE students!
I struggled to understand the concept of the Simplex Algorithm until I came across this series of video tutorials. They are exceptionally well-structured and clearly articulated. Thank you for the outstanding work-you're amazing!
Thank you for taking your time to leave a comment, it is greatly appreciated! I hope you enjoy learning Simplex and Operations Research in general. The latest additions to my channel are the videos in Queuing Theory, if you'd like to check them out: ruclips.net/p/PL0ZLI5mvN8kDFMlpj209S5CB35utJakXL&si=5KEofjFwwuNCl9Vt Happy New Year!
If you had uploaded this video earlier, I would have passed the stochastic course with a much better grade. Anyway great video
Thank you! I just happen to find the time these days to create the Queuing Theory videos. Anyway, I'm sure you've done your best for your Stochastic course and that's all that matters. Happy New Year!
I was really happy to see the video. Thank you very much for accepting our request and starting to make queueing theory videos.
Thank you for your appreciation! Happy New Year!
you are my hero didi. ily so much please answer <333
Thank you, I feel honored to be your hero! Happy New Year! And if you need a hero for Queuing Theory, here it is: ruclips.net/p/PL0ZLI5mvN8kDFMlpj209S5CB35utJakXL&si=5KEofjFwwuNCl9Vt
Allah Razı Olsun
Teşekkür ederim...
AMAZING JOB!! thank youu
You're welcome! I hope you enjoy learning Dynamic Programming from my videos.
Daqquota Problem
dalga gecme len hocamla
quize calis
Hello! Thank you for watching my videos. I hope you enjoy learning OR through Daqquota Problem ;)
Büyüğünü bilen büyüğünden daha büyüktür. Utan kendinden.
adamsin dididedi
Odtü?
Teşekkürler!
adamin dibisin dididedi
Teşekkürler! I hope you enjoy learning OR from my videos.
A feasible solution can be a basic solution, but not all feasible solutions are basic solutions that’s why i think sir B and C both options are correct
Hello! 13:30 A feasible solution must be a basic solution, therefore all feasible solutions are basic solutions. Only B is correct. C is not true because a bfs is always a basic solution. Remember that bfs is a subset of basic solution (see 6:21 ).
very goodddddd
Thank you!!
thanks Deby!
You're welcome! I hope you enjoy learning Transportation.
thx Dedy!
You're welcome! Good luck on your OR exams or assignments.
thank you Dedy
you're welcome!
As a student studying OR courses in Chinese college, I feel it difficult to comprehend some concepts and applications of DTMC and CTMC. But these videos give me a more clear insight regarding relevant knowledge. So happy to watch excellent courses like these!
Hello! I'm so glad to hear my videos are helping your understanding in Markov Chains. Enjoy learning Markov Chains and feel free to watch my videos in other OR topics.
thx
you're welcome! Have you been binge watching all videos in the Duality playlist?
great as always, Deby
thank you for watching my videos!
thank you Dedy!
you're welcome!
thanks
you're welcome!
10 ounces of nothing hahahahh
It is my favorite way of interpreting the artificial variables :D Thanks for watching my videos!
thank you Deby!
You're welcome! I hope you enjoyed learning about Weak Duality.
thank you!
you're welcome!
thanks Dedy
you're welcome!
thanks, Dedy. Great as always
You're welcome! I hope you enjoyed learning about Dual Linear Programming.
gracias!
you're welcome!
is there a pdf version of these files @dididedi
Hello! Up to this point, the pdf is only for the students in my class. Anyway, thank you for watching my videos!
great stuff !!!
Thanks for watching my videos. I hope you found the video about bfs helpful, as well as other OR videos on my channel.
imma biggest fan of you
Hello! Thanks for being my biggest fan, I feel honored. I hope you enjoy learning OR as well.
what about that 1$ per gallon cost we purchased from dairy , shouldn't our net profit be (2-1)$ per gallon?
Hello! Thanks for the question. You are right. If we'd like to calculate the profit, then we should subtract the optimal revenue ($9.75) at 21:00 with $6, because Safeco purchased six gallons of milk for a price of $1/gallon.
please continue to teach us how to be industrial engineer.thanks a lot for lectures🙏🙏🙏🙏
Hello! Thanks for the compliment. I hope you enjoy learning OR through the videos on my channel and good luck on your Industrial Engineering study.
hello sir, is there a way to avoid cycling? I learned that following the Bland's rule can avoid cycling, but I didn't understand it clearly, I'm still a little confused on how to pick variables to enter/leave the basis. Could you please talk about this part if you have time? Thank you so much!!!Your videos are super super helpful and I really appreciate your work! they're great!
Hello! Bland's rule says that when we choose the Entering Variable, instead of choosing the variable with the most positive coefficient variable in Row 0, we firstly collect all variable with positive coefficients and then select the one with the smallest index. Here's the reference: www.matem.unam.mx/~omar/math340/blands-rule.html I'm glad you found my videos super helpful, I hope you enjoy learning OR!
Bro my exam is tomorrow you're so clutch I love you!!!!
I hope you did well on your exam! Thanks for watching my videos and hope you'll enjoy learning OR in general.
hi, how does this differ from stochastic dual dynamic programming?
Hello! Thanks for the question. I am not familiar with Stochastic Dual Dynamic Programming, but from what I've read, the key difference is this: Probabilistic Dynamic Programming models uncertainties using probabilities for each transition. On the other hand, Stochastic Dual Dynamic Programming uses a set of possible future scenarios; for example, different realizations of weather.
thank you so much for the lecture Dididedi
You're welcome! I hope you enjoy learning Dynamic Programming. There are other videos in various OR topics, as well as Data Analytics. Hope you'd find them useful, too. Thanks for watching my videos!
thank you friend
You're welcome! I hope you enjoy learning Simplex & OR. Thanks for watching my videos.
hello... is it correct that there are 2 optimal solutions? 1-4-3-2-1 and 1-2-3-4-1? In practice is there a way to make sure that it is truly optimum? ie similar to linear programming where we can "sense check" the answer by observing boundary condition being satisfied, how would we (say in daily process) know that the solution is optimum?
Hello! Yes, there are 2 optimal solutions like you mentioned. It may be seen from Stage 1 (16:08). It is an interesting question. Right now, I can't think of a practical way to "sense check" the optimality of the answer in Dynamic Programming. Thanks for watching my videos!
Before I saw the video, I had no idea about steady-state probabilities. But now I understand it very well. Thank you very much for this video, Professor Dedy.
Hello! I'm glad to hear that. Thanks for watching my videos and I hope you enjoy learning Markov Chains, it's a very interesting topic.
may i know which textbook are you using? your videos helped a lot thank you
@@janissatang1097 Here's the textbook, I'd say it's an amazing one: "Operations Research: Applications and Algorithms" by Wayne L. Winston. Thanks for watching my videos, I'm glad you found them helpful. Enjoy learning OR!
Mampir dari talkshow tadi ICGS :D
@@erjhg-w5k Terima kasih, semoga banyak hal bermanfaat dari ICGS TI Unpar ya!
Would it be possible for you to share the PowerPoint slides or any additional materials from the lecture? I believe they would be very helpful for my self-study and further exploration of the topic.
Hello! While I cannot provide the ppt slides, I may suggest the textbook: "Operations Research: Applications and Algorithms" by Wayne L. Winston. It's a great book and I used it as the main reference of my videos.
thanks for the detailed explaination
You're welcome! I'm glad that you found the videos helpful.
I think it should not be "employee beginning work at i-th day", because the number of employees at the first week would be different from second week and so on. It will be better to call x1 - the number of employees who work from Monday to Friday, ...., x7 - the number of employees who work from Sunday to Thursday. The the number of employees each week will be the same.
Hello! Thanks for the suggestion. The definition of x1 = "the number of employees who work from Monday to Friday" would be precise. However, defining x1 = "number of employees beginning work at day i" is also fine because the i (1, 2, ..., 7) is defined on the table (see 7:30 ) and we know if somebody starts at day-1 (i.e., Monday), he/she will work until day-5 (i.e., Friday).
Helped with my Econ homework, thanks so much!
You're welcome! I'm glad that you found my video helpful, thanks for watching and you may find videos about other topics (OR, Data Analytics) on my channel.
these courses saved me in class, thank you
You're welcome! I hope you passed the course successfully and you enjoy learning OR.
Does MS Excel solver gives the same answer?
Hello! MS Excel solver should provide the same optimal answer.