Question

In: Operations Management

Consider a supplier order allocation problem under multiple sourcing, where it is required to buy 2000...

Consider a supplier order allocation problem under multiple sourcing,
where it is required to buy 2000 units of a certain product from
three different suppliers. The fixed set-up cost (independent of the
order quantity), variable cost (unit price), and the maximum capacity
of each supplier are given in Table 5.15 (two suppliers offer quantity
discounts).
The objective is to minimize the total cost of purchasing (fixed plus
variable cost). Formulate this as a linear integer programming problem.
You must define all your variables clearly, write out the constraints to
be satisfied with a brief explanation of each and develop the objective
function.
TABLE 5.15
Supplier Data for Exercise 5.5
Supplier Fixed cost Capacity Unit Price
1 $100 600 units $10/unit for the first 300 units
$7/unit for the remaining 300 units
2 $500 800 units $2/unit for all 800 units
3 $300 1200 units $6/unit for the first 500 units
$4/unit for the remaining 700 units

Solutions

Expert Solution

Let us first construct a table with all the information related to total capacity of each supplier, supplier fixed cost and supplier variable cost information & calculate net cost of procurement of 1 unit from each supplier.
Fixed Cost Total Capacity Quantity of first lot offered Variable Cost of first lot Quantity of balance lot Variable cost of balance lot Net cost of procurement of 1 unit
A B C D E F G=(A+C*D+E*F)/B
USD Units Units USD/Unit Units USD/Unit USD / Unit
Supplier 1 100 600 300 10 300 7 5.25
Supplier 2 500 800 800 2 0 0 2.63
Supplier 3 300 1200 500 6 700 4 2.76
Now let us represent Net cost of procurement of 1 unit from each supplier is represented by N1 , N2 & N3
So we have Net cost of procurement of 1 unit
USD / Unit
N1 5.25
N2 2.63
N3 2.76
Also let us assume that quantity to be procured from Supplier 1 , Supplier 2 & Supplier 3 is represented as Q1, Q2 & Q3.
Now let us formulate the objective function of linear programming which is
Minimize N1*Q1+N2*Q2+N3*Q3 as the objective is to minimize the total cost of purchasing .
Where the constraint is Q1+Q2+Q3=2000 units
This means total quantity to be procured from all three suppliers can not exceed 2000 units.
Now solving this is easier as first we will do is we will exhaust the total capacity of lowest cost supplier which is Supplier 2.
So we will buy 800 units from Supplier 2.
So we have Q2 = 800
Balance to be procured is 2000-800 = 1200 units
Next lowest supplier is Supplier 3 whose capacity is 1200 . So we will buy 1200 units from supplier 3.
So we have Q3 = 1200 units.
Now balance to be procured is 1200-1200=0
So we do not have anything to be bought from Supplier 1 .
So we have Q1 =0
Now solving the linear equation we have N1*Q1+N2*Q2+N3*Q3=0*5.25+800*2.63+1200*2.76 = 5416 USD

Related Solutions

Consider a supplier order allocation problem under multiple sourcing, where it is required to buy 2000...
Consider a supplier order allocation problem under multiple sourcing, where it is required to buy 2000 units of a certain product from three different suppliers. The fixed set-up cost (independent of the order quantity), variable cost (unit price), and the maximum capacity of each supplier are given in Table 5.15 (two suppliers offer quantity discounts). The objective is to minimize the total cost of purchasing (fixed plus variable cost). Formulate this as a linear integer programming problem. You must define...
Prove that an abelian group G of order 2000 is the direct product PxQ where P...
Prove that an abelian group G of order 2000 is the direct product PxQ where P is the Sylow-2 subgroup of G, and Q the Sylow-5 subgroup of G. (So order of P=16 and order or Q=125).
Consider a medium where the speed of sound is 354 m/s. In this medium, a 2000...
Consider a medium where the speed of sound is 354 m/s. In this medium, a 2000 Hz sound wave is incident on two slits 30.0 cm apart. This creates an interference pattern on a distant screen. In analogy to double slit interference of light waves, the equation d sin ✓ = m can be used to find the location of the maxima, in the same way that it does for Young's double slit experiment with light. (a) At what angle...
Consider an exchange economy. Is it possible to have a Pareto optimal allocation where one consumer...
Consider an exchange economy. Is it possible to have a Pareto optimal allocation where one consumer is worse off than she is at a different allocation that is not Pareto optimal? Explain.
Consider the missile allocation problem (MAP) with discretized time. (a) For MAP, an extreme case may...
Consider the missile allocation problem (MAP) with discretized time. (a) For MAP, an extreme case may be to maximize the probability of shooting down only those ASMs targeting the high value ships, ignoring the rest. How can you modify MAP model to accomplish that situation? (b) The probability of no leaker may be a very small figure, when there is a large number of attacking ASMs. For such cases, modify the objective function for maximizing the expected number of ASMs...
AEROSPACE ENGINEERING PROBLEM Calculate the propellant mass required to launch a 2000 kg spacecraft from 180...
AEROSPACE ENGINEERING PROBLEM Calculate the propellant mass required to launch a 2000 kg spacecraft from 180 km circular earth orbit on a Hohmann transfer trajectory to the orbit of Saturn. Calculate the time required for the mission, and assume the propulsion system has a specific impulse of 300 seconds. Saturn's orbit about the Sun is 1.43x109 km and the Earth's orbit about the Sun is 149.6x106 km. Could someone please give me a hand. Thank You :)
how ABC(activity based costing) method overcomes the problem of over/under allocation of overheads between products.
how ABC(activity based costing) method overcomes the problem of over/under allocation of overheads between products.
Consider the following facts and answer the questions which follow under the heading “Required”. (This is...
Consider the following facts and answer the questions which follow under the heading “Required”. (This is all the case evidence given by source) Vince Scaleri made an arrangement with two of his friends saying that he would be glad if they would in their own time provide him with firewood during the winter of 2019. Vince lived in Georgetown, roughly 50 kilometres from the woodyard of his two friends.   Vince stated that the firewood should be cut to a length...
15.5. Consider a bundling problem where the principal is the seller of a good with a...
15.5. Consider a bundling problem where the principal is the seller of a good with a value function v = t − 2 q where t is the price charged for a bundle and 2 q is the cost of the bundle that contains q units of the √ good. A buyer of type θ has a utility function u ( q , t ) = θ q − t , where θ is either 16 or 20 with probability...
Problem 1: Consider the following Initial Value Problem (IVP) where ? is the dependent variable and...
Problem 1: Consider the following Initial Value Problem (IVP) where ? is the dependent variable and ? is the independent variable: ?′=sin(?)∗(1−?) with ?(0)=?0 and ?≥0 Note: the analytic solution for this IVP is: ?(?)=1+(?_0−1)?^cos(?)−1 Part 1A: Approximate the solution to the IVP using Euler’s method with the following conditions: Initial condition ?_0=−1/2; time step ℎ=1/16; and time interval ?∈[0,20] + Derive the recursive formula for Euler’s method applied to this IVP + Plot the Euler’s method approximation + Plot...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT