Ch6: Limiting Factor Decisions Flashcards

SINGLE LIMITING FACTOR (1) Limiting Factor Analysis (2) One Limiting Factor (3) Shadow Price (4) Throughput Accounting (5) Decisions with a Limiting Factor (6) Shadow Prices in Make vs Buy MULTIPLE LIMITING FACTORS (7) Linear Programming (8) Limitations of using the Graphical Method (9) Slack (18 cards)

1
Q

What is Limiting Factor Analysis?

A

It is used to maximise contribution and profit by using scarce resources on the products that make the best use of them when sales demand is greater than productive capacity.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What are examples of limiting factors in production?

A
  • Labour.
  • Materials.
  • Machinery.
  • Factory space.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is the rule for limited resources in Limiting Factor Analysis?

A

Make all those products which give a positive contribution up to maximum demand.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is the approach to decide which products to make when one factor of production is limited?

A

(1) Identify the limiting factor.

(2) Calculate the contribution per unit of each product.

(3) Calculate the contribution per unit of limiting factor.

(4) Rank the products (Highest contribution = 1st).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

How do you calculate the Contribution Per Unit of Limiting Factor?

A

Contribution Per Unit of Limiting Factor = [ Contribution Per Unit (CPU) / Units of Scarce Resources Used ]

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What are the limitations of Key Factor Analysis?

A
  • Assumes a single objective of profit maximisation.
  • Constant VCPU and TFC
  • Deals with only one scarce resource, and applies only to short-term capacity constraints.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is a Shadow Price?

A

The additional contribution that would be generated if one more unit of the scarce resource were to become available.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

How is the maximum price for an additional unit of scarce resource calculated?

A

Maximum Price for an Additional Unit of Scarce Resource = Regular Price + Shadow Price.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What are the steps in Throughput Accounting?

A

(1) Determine the bottleneck resources.

(2) Calculate the throughput per unit.

(3) Calculate the throughput return per hour of bottleneck resources.

(4) Rank the products.

(5) Allocate resources to arrive at an optimum production plan.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is the formula for Savings Per Unit of Scarce Resources in make vs buy decisions?

A

Savings Per Unit of Scarce Resources =
[ (Buy In Price - Variable Cost to Make) / Number of Units of Scarce Resources Used Per Unit ]

GREATEST SAVINGS PER UNIT OF SCARCE RESOURCES = HIGHER PRIORITY.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

When is the Shadow Price relevant in make vs buy decisions?

A

(1) When internal production is limited due to the shortage of a particular factor.

(2) When production of some items is being outsourced.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What is an Objective Function in Linear Programming?

A

A quantified statement of the aim of a resource allocation decision, such as profit maximisation or cost minimisation.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is a Constraint in Linear Programming?

A

An activity, resource, or policy that restricts the business from achieving its objectives.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What is the Feasible Region in Linear Programming?

A

An area contained within the constraint lines on a linear programming graph that shows all the feasible combinations of output.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What are the steps in the Linear Programming process?

A

(1) Define variables.

(2) Formulate the objective function.

(3) Express constraints in terms of inequalities.

(4) Plot constraints on a graph.

(5) Identify the feasible region.

(6) Plot the slope of the objective function.

(7) Calculate the value of the objective function at the optimal point.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What are the limitations of using the Graphical Method in Linear Programming?

A
  • LINEARITY = Contribution and resource utilisation per unit are the same for any quantity produced and sold in the range under consideration.
  • INFINITE DIVISIBILITY OF PRODUCTS = Can’t be rounded or have integers as ROUNDING UP = may be outside the feasible region or ROUNDING DOWN = may go away from the origin.
  • SOLUTION IS DEPENDENT ON QUALITY OF INPUT DATA - must be complete, accurate and valid.
  • ONLY ONE QUANTIFIABLE OBJECTIVE can be satisfied.
17
Q

What is Slack in Linear Programming?

A

Occurs when the maximum availability of a resource or other constraining factors is not used, indicating spare capacity.

18
Q

What are the implications of high and low slack?

A
  • High slack = inefficient use of a resource,
  • Low slack = resources could become a binding constraint.