In following answer for best mix of services to provide to maximize contribution. I wonder why we take machine and labour time to get value of b and p
but why cant we take materials.
specialised cleaning materials 0.1B + 0.15P < 60
Labour time 0.5B +1P < 300
Machine time 0.5B + 0.25P < 150
Minimum number of Basics B < 25
Minimum number of Premieres P < 50
solving simultaneous equations:
Machine time 0.5B + 0.25P < 150
Labour time 0.5B +1P < 300
After solving the above equations simultaneously,
B = 200, and P = 200
Ask the Tutor ACCA PM
linear programing
8y ago#1Cleaning material are not a binding constraint. Did you draw the graph? If you did draw the graph you will see that the feasible region is bounded by Labour and machine time, and that the material is not binding.
I do suggest that you watch my free lectures on linear programming. The lectures are a complete free course for Paper F5 and cover everything needed to be able to pass the exam well.
(As I explain in the lectures, you can no longer be asked to draw the graph in the exam, but you are expected to understand and to be able to interpret the graph)
Sign in to reply to this topic.