• Skip to primary navigation
  • Skip to main content
Free ACCA & CIMA online courses from OpenTuition

Free ACCA & CIMA online courses from OpenTuition

Free Notes, Lectures, Tests and Forums for ACCA and CIMA exams

  • ACCA
  • CIMA
  • FIA
  • OBU
  • Books
  • Forums
  • Ask AI
  • Search
  • Register
  • Login
    • BT
    • MA
    • FA
    • LW
    • PM
    • TX-UK
    • FR
    • AA
    • FM
    • SBL
    • SBR
    • AAA
    • AFM
    • APM
    • ATX
    • Dates
    • What is ACCA

June 2025 ACCA Exams

How was your exam? Comments & Instant poll >>

20% off ACCA & CIMA Books

OpenTuition recommends the new interactive BPP books for September 2025 exams.
Get your discount code >>

ACCA F5 Limiting Factors Lecture 3 Example 1

VIVA

Reader Interactions

Comments

  1. myacca1990 says

    August 16, 2018 at 9:00 am

    Thank you Sir!
    My concepts on this topic were never this much clear.

    Log in to Reply
    • John Moffat says

      August 16, 2018 at 11:56 am

      Thank you for your comment 馃檪

      Log in to Reply
  2. loukasierides says

    June 17, 2018 at 1:59 pm

    dear Sir,

    thank you for another great lecture, i sometimes have trouble extending the iso contribution line and realizing which is the actual point of intersection I should use. Is its worth substituting values at both points and use the one which generates the highest contribution? in this example C or D even though it is clear here.

    Log in to Reply
    • John Moffat says

      June 17, 2018 at 5:44 pm

      Yes – that is fine (provided you can do it quickly 馃檪 )

      In the exam you cannot be asked to draw the graph, but you can be given a graph and asked to solve it.

      Log in to Reply
      • loukasierides says

        June 18, 2018 at 9:37 pm

        oh i see ! i thought this time I would i actually get to draw a graph! thank you very much!

      • John Moffat says

        June 19, 2018 at 6:28 am

        You are welcome 馃檪

  3. khanumishq says

    May 10, 2018 at 9:45 pm

    Why is the optimum production plan not at point A? Is it because that is not the intersection point of two constraints?

    Log in to Reply
    • John Moffat says

      May 11, 2018 at 6:26 am

      It is because point B is the furthest point from the origin when you move out the iso-contribution line keeping in parallel.

      I do explain this in the earlier lectures.

      Log in to Reply
  4. loukasierides says

    January 5, 2018 at 7:09 pm

    Dear Sir,

    thank you for another incredible lecture, i wish they did ask me to draw this graph, it would be easy marks.

    Log in to Reply
    • John Moffat says

      January 6, 2018 at 8:46 am

      You are welcome.

      Log in to Reply
  5. angelaht says

    December 3, 2017 at 4:07 pm

    Hi John,

    Thank you for your lectures. I am so confident doing Linear programming with 2 constraints.
    However, I have revised this topic and one of the questions gave me 3 constraints.
    1. Skilled labour hours 4x + 5y = 9600
    2. Silk Powder 3x +2y = 5000
    3. Silk Amino x + 0.5y = 1600
    Lotions demand y =2000
    Cream demand x – unlimited

    To calculate to optimum production, the solution uses 1 and 2.

    At first, I used 2 and 3. But the answer isnt the same.

    Is there any reason we should use this constraints equation rather than the others?

    This question I got from BPP Exam kit.

    Thanks,
    Angela

    Log in to Reply
    • John Moffat says

      December 3, 2017 at 6:30 pm

      In future you must ask this kind of question in the Ask the Tutor Forum – not as a comment on a lecture.
      You can’t just pick two constraints at random – you need to draw the graph in order so what the feasible region is.

      Log in to Reply
      • angelaht says

        December 3, 2017 at 7:54 pm

        Thank you John

      • John Moffat says

        December 4, 2017 at 7:14 am

        You are welcome 馃檪

      • daynaellis says

        May 12, 2018 at 4:49 pm

        Hi,

        Sorry just to expand on this – as we cannot be expected to draw the graph in a computer based exam, would any questions to do with linear programming be with 2 constraints only so that it would be a case of establishing the simultaneous equations then solving them?

        Thank you.

      • John Moffat says

        May 13, 2018 at 7:17 am

        No – there can be more than two constraints. You will not be expected to draw the graph, but a graph may be given you as part of the question.

  6. Samuel Koroma says

    October 2, 2017 at 6:13 pm

    Mr Moffat are we going to be given the value of the objective function (I.e.maximize contribution ‘C’ ) when drawing an iso-contribution line to solve for the optimal solution using the graph or we assume a value for C?

    When is it feasible to use simultaneous equations to solve for the optimum production plan not using the graph?

    Log in to Reply
  7. sxhawty says

    April 20, 2017 at 10:00 am

    My institute’s tutor taught this already and for some reason the way he teaches makes it hard for me to understand it but everytime i watch your lecture I understand it like magic.. Thankyou Sir Moffat! God Bless you!

    Log in to Reply
    • John Moffat says

      April 20, 2017 at 5:06 pm

      And thank you very much for your comment 馃檪

      Log in to Reply
  8. Samuel Koroma says

    April 4, 2017 at 9:03 am

    Wow! We can use an iso-contribution line ( a line of equal contribution) to find the optimum solution from the graph or we take the binding constraints (in this case materials and labour) to formulate another equation that can be used to find the values of S and E. This then can be used to calculate the maximum contribution. Thanks so much John for clarity in this topic.

    Log in to Reply
    • John Moffat says

      April 4, 2017 at 3:06 pm

      You are welcome 馃檪

      Log in to Reply
  9. haidershah says

    February 16, 2017 at 9:57 pm

    if we go with 24S and 10E the it comes to 234 still in the feasible Region

    24 * 6 = 144 and 10* 9 = 90

    144+90 = 234 so its more then 225 please comment

    Log in to Reply
    • Syed Muhammad says

      May 29, 2017 at 10:33 pm

      Look at the graph again, its certainly not in the feasible region, another way is to put those numbers for S and E into one of the binding constraint equations.

      2S + 4E <= 80, if we were to make 24 S and 10 E, the equation would be:

      2(24) + 4(10) = 88 which is as far as I know not less than or equal to 80

      Log in to Reply
  10. alaccountancy says

    January 28, 2017 at 4:55 pm

    Hi

    Firstly, thank you so much for your excellent lectures.

    One thing I struggle with is getting a parallel outward shift of my ruler to the furthest point of production within the feasible region.

    I’m sorry if this is a silly question, but will the furthest point always coincide with the point where two of the limiting factors intersect (like it did in your example) or is it possible that the parallel outward movement of the objective function line could land on a point/corner of the feasible region before reaching the point where the two limiting factor lines intersect?

    I’m really sorry if this has not been worded clearly/is a silly question.

    Thank you.

    Log in to Reply
    • John Moffat says

      February 17, 2017 at 6:55 am

      The furthest point away from the origin (the optimal point) will always be where two of the constraints intersect – i.e. at one of the corners of the feasible region.
      The point of moving out the contribution line while keeping it parallel is in order to identify which of the corners is the best one.

      Log in to Reply

Leave a Reply Cancel reply

You must be logged in to post a comment.

Copyright © 2025 路 Support 路 Contact 路 Advertising 路 OpenLicense 路 About 路 Sitemap 路 Comments 路 Log in