LINEAR PROGRAMMING (GRAPHICAL METHOD) - PM/MA
Вставка
- Опубліковано 11 кві 2022
- This video explains the linear programming (graphical method). Shadow Price concept were also explained in this video. Students preparing for. performance management ACCA F5, management accounting and operation research/ Quantitative analysis will also find this. lecture helpful.
To watch part 1, kindly tap the link below:
• Financial Accounting (F3)
#linearprogrammingproblem
#linearprogramming
#f5
#performancemanagement
#managementaccounting
#accounting
#accountingstudy
#accountingstudy
#linearprogrammingproblems
#pm
Thank you so much sir. I appreciate your teaching, it was very explanatory and your method was extremely easy to grasp. I pray the Lord empower and enriches you
Amen, thank you very much
You are really helping me with this unit.
God will reward you abundantly sir, thank you sir
Excellent Sr. Good bless you.
Thanks so much sir ! May Almighty God continue to bless you 🙏🙏🙏 This is so helpful
Amen
Keep the good work Sir... I can't find the video on Replacement Theory
Thank you so much for this🙏
May Almighty God continue to give you more wisdom and knowledge Sir.
Amen
well done 💯
Thank you so much
Please can I get the link to the first part
Thank you so much sir
God bless you sir
Thank you for this explanation. When determining the shadow price for minimization objective, is it the same approach with this maximization objective? Thank you
Yes, same approach, but with the inequality equation that minimize cost
May Allah reward u accordingly
Amen
is transfer pricing same thing with divisional performance, i cant find divisional performance lectures
I have not released video on divisional performance
what is the other method of producing shadow price.dual method and which one
Increase in constraints by one method
Good lecture, sir. I'm curious, what indicates the use of the graphical method in a question? In the previous one, we were given a binding equation; and advised to solved simultaneously however, you mentioned that it's what we solve from the graph that gives us the “binding equation “. Could you kindly elaborate a bit on this, can I randomly use the constraint directly without the graph, or there is something that tells me why to use graph in the question , Thanks 🙏
Graphical method can only be used where the variables are limited to two even when the constraints are more than two.
The example you referred to, the binding constraints have been given, the essence of graph is to know the binding constraints at the point of intersection of two lines that simultaneously satisfy all the constraints
@@Ezikan Thank you for the feedback Sir. Is the binding constraint at Conner B, where we achieve the highest output of 20,500? This was calculated as follows:
40M + 50N
40(200) + 50(250) =
8000 + 12500 = 20500
??…
I have been trynna to figure out where it is …..?
What is the Binding equation on the graph, like the one shown to us in simultaneously equation part???
The one in wish the constraints are simultaneously satisfy
@@Ezikan Sorry, I'm new to this topic, sir. I don’t understand what you mean by 'one in wish.' Do you mean it’s the equation around the feasibility area, or are you referring to the original constraints given in the question? I have seen a question where binding equations are given. I am trying to know how to spot it or in this case, what it is in this question??
@Nick_j336 The one which satisfy all the inequality condition
I can't find your video on Divisional Performance
Not yet ready
i cant find the simplex method
If I have time by next week, I will record the video on the simplex method
Good day Sir, I'm kindly requesting for for times series part 2 lecture video
ua-cam.com/video/Q-UZlNVDqco/v-deo.html
@@Ezikan Hello sir, do you have a revision class, if so how can I join ?
Get rid of the music. It make concentration difficult. It's so distracting
Noted