Forums › Ask ACCA Tutor Forums › Ask the Tutor ACCA PM Exams › Constraints.[Linear Programming]
- This topic has 8 replies, 3 voices, and was last updated 3 years ago by John Moffat.
- AuthorPosts
- April 3, 2021 at 4:04 am #615792
Sir,
In order to find the optimum production we need to solve 2 equation of several constraint. Well how to pick up two most relevant constraint to do arithmetic on?
for example for these constraint how to pick.Labour constraint 9600> 4x+5y
Silk amino constraint 1600> x+.05y
Silk powder constraint 5000> 3x+2yAlso sir can you tell me what a binding constraint is..Are the most two relevant constraint termed as binding constraint.
April 3, 2021 at 9:50 am #615810We find the two relevant constraints by drawing the graph as I explain in my lectures.
Obviously you cannot be expected to draw a graph in the exam, but you can be given the graph and be expected to deal with it.
The binding constraints are those that are limiting the production, again as I do explain in my lectures.
April 3, 2021 at 9:59 am #615812Sir what if it’s a 2 mark questions with multiple constraints and we have to find optimum production for contribution maximisation..So how to cope with identifying binding constraint from several.?
April 3, 2021 at 10:15 am #615817That cannot happen in the exam in a 2 mark question, unless either it is obvious by looking at the constraints (which is very unlikely to be the case, although you could do a quick graph in your rough workings), or unless it is testing something other than linear programming such as key factor analysis or throughput accounting.
If you have come across a question for which you think this is a problem, then if it is a past exam question or a question in the current edition of the BPP Revision Kit, tell me which question and I will explain why there is not a problem 🙂
April 5, 2021 at 3:48 am #615940Sir what do you mean by” unless it’s obvious”?
Does it mean that if perhaps labor and materials are constraint then the kg and hrs for 2 products will be almost same..
So in that situation whereby quantity required by all constraint for 2 products is almost same so the binding constraint will with least Right hand side or availability right?
Ex if qty for constraint are same and availability is 500,1000,2000,5000
So 500 and 1000 would be binding constraint right?April 5, 2021 at 9:26 am #615954That would be an example of what I mean by it being obvious.
However it is better if you tell me which question or questions from your Revision Kit (or past exam) that is giving you this problem! Then I can explain.
April 5, 2021 at 3:16 pm #615998No sir I do agree with you and I haven’t yet found a question like that. And thank you very much.!
My doubt is clearedApril 5, 2021 at 3:26 pm #616000Yes sir even I agree there isn’t a question like that yet.
Thanks for your valuable explanation..April 5, 2021 at 3:36 pm #616005You are both welcome 🙂
- AuthorPosts
- The topic ‘Constraints.[Linear Programming]’ is closed to new replies.