15 January 2020

ACCA PM Chapter 6 - Limiting Factors

Linear Programming
  1. Define the unknowns in terms of symbols
  2. Formulate equations for the constraints
  3. Formulate an equation for the objective
  4. Graph the constraints and the objective
  5. Find the optimum solution


Spare capacity
If the optimum solution results in using less than the maximum available of a particular resource, then we have spare capacity of that resource or slack.

Shadow prices (dual price)
Shadow Price is the most EXTRA we would be prepared to pay for an extra unit of the limited resource.



No comments:

Post a Comment

Open Source Information Gathering using Windows Command Line Utilities

 How to Find the Maximum Frame Size Packet needs to be fragmented but DF set, means that the frame is too large to be on the network and ne...