Linear Programming – Maximum contribution – ACCA Performance Management (PM)
Reader Interactions
Comments
Leave a Reply
You must be logged in to post a comment.
Free ACCA & CIMA online courses from OpenTuition
Free Notes, Lectures, Tests and Forums for ACCA and CIMA exams
June 2025 ACCA Exam Results
20% off ACCA & CIMA Books
OpenTuition recommends the new interactive BPP books for June 2025 exams.
Get your discount code >>
Hi Sir,
Please can you explain a little bit more why you have multiplied 1 and 2 by 2.5 simply because both have 5 S?
Thank you
It is just to have the same number of S’s in both equations so we can then subtract one equation from the other and S then disappears.
You can use any numbers provided you get the same number of S’s in each equation.
why have we not selected point C?
Dear Sir, while expanding imaginary lines in feasible region we said that point B is the farthest it can go. why have we ignored A because that is the farthest we can go ?
If you keep the line parallel and move it out then the furthest point without leaving the feasible region is B.
Handy hint for others may be – I worked through this chapter with you, making notes and writing down the example workings as you did using a different coloured pen for each of the 4 limitation equations & lines. The following week (I study 1 full day per week) I watched all the videos again to absorb the info better as a recap, and made a few extra notes with a pencil, and it really sunk in properly this time 馃檪
Loved the lecture. Thank you so much!
Thank you for your comment 馃檪