LINEAR PROGRAMMING ASSIGNMENT I , TO BE DONE IN GROUP OF 5

STUDENTS , SUBMISSION DATE 06/02/2020, NO ASSIGNMENT WILL BE

COLLECTED AFTER THIS SAID DATE , MR.KICHE

Q1 i) Define the following terms as used in linear programming

Model, Objective function, Constraints , Model formulation, Feasible solution,
Transportation problems, Allocation problems
ii) Define the term linear programming and explain the five steps followed when
formulating a linear programming model mathematically.
v) List the basic properties of linear programming models hence discuss the linear programming
model assumptions indicating the linear programming mathematical statements.
Q2) A farmer has 10 acres to plant in wheat and rye. He has to plant at least 7 acres. However,
he has only $1200 to spend and each acre of wheat costs $200 to plant and each acre of rye costs
$100 to plant. Moreover, the farmer has to get the planting done in 12 hours and it takes an hour
to plant an acre of wheat and 2 hours to plant an acre of rye. If the profit is $500 per acre of
wheat and $300 per acre of rye how many acres of each should be planted to maximize profits?

Q3). A gold processor has two sources of gold ore, source A and source B. In order to kep his
plant running, at least three tons of ore must be processed each day. Ore from source A costs $20
per ton to process, and ore from source B costs $10 per ton to process. Costs must be kept to less
than $80 per day. Moreover, Federal Regulations require that the amount of ore from source B
cannot exceed twice the amount of ore from source A. If ore from source A yields 2 oz. of gold
per ton, and ore from source B yields 3 oz. of gold per ton, how many tons of ore from both
sources must be processed each day to maximize the amount of gold extracted subject to the
above constraints?

Q4) .A publisher has orders for 600 copies of a certain text from San Francisco and 400 copies
from Sacramento. The company has 700 copies in a warehouse in Novato and 800 copies in a
warehouse in Lodi. It costs $5 to ship a text from Novato to San Francisco, but it costs $10 to
ship it to Sacramento. It costs $15 to ship a text from L-odi to San Francisco, but it costs $4 to
ship it from Lodi to Sacramento. How many copies should the company ship from each
warehouse to San Francisco and Sacramento to fill the order at the least cost?

Q5) A company is involved in the production of two items (X and Y). The resources need to
produce X and Y are twofold, namely machine time for automatic processing and craftsman time
for hand finishing. The table below gives the number of minutes required for each item:
 Machine time Craftsman time
Item X 13 20
Y 19 29
The company has 40 hours of machine time available in the next working week but only 35
hours of craftsman time. Machine time is costed at £10 per hour worked and craftsman time is
costed at £2 per hour worked. Both machine and craftsman idle times incur no costs. The
revenue received for each item produced (all production is sold) is £20 for X and £30 for Y. The
company has a specific contract to produce 10 items of X per week for a particular customer.
Formulate the problem of deciding how much to produce per week as a linear program.
Solve this linear program graphically.
SECTION B
𝑄1) A company has four factories and three warehouses located in market areas. The
capacities of supply points are [ 350 450 520 340 ] and the demands of the destination
are[ 460 500 480]. The cost associated with transporting one unit of the resource from a
supply point to a destination is as follows
D1 D2 D3
S1 3 2 1
S2 1 1 2
S3 2 1 1
S4 1 2 3
By making the initial allocation using North West Corner Rule, Least Cost Method and
Vogel Approximation Method determine optimal allocation that minimises the
transportation cost
Q2) Consider the transportation problem presented in the following table:

Destination

Origin 1 2 3 4 Supply

1 250 350 360 600 150

2 550 300 450 380 60

3 400 500 260 650 140

4 600 400 660 270 110

Demand 100 120 150 90

Use North West Corner Rule to determine the optimal allocation that minimizes the
transportation cost . Perform also the Modified Distributed Algorithm (MODI) to determine the
transportation cost.
Use Minimum Cost Rule to determine the optimal allocation that minimizes the transportation
cost .
Use Vogel Approximation Method to determine the minimum cost of transportation

Q3) i) Define a transportation problem.

ii) Consider the transportation problem presented in the following table:

Destination

Origin 1 2 3 Supply

1 2 7 4 50

2 3 3 1 80

3 5 4 7 70

4 1 6 2 140

Demand 70 90 180 340

.
Use North West Corner Rule to determine the optimal allocation that minimizes the
transportation cost . Perform also the Modified Distributed Algorithm (MODI) to determine the
transportation cost.
Use Minimum Cost Rule to determine the optimal allocation that minimizes the transportation
cost .
Use Vogel Approximation Method to determine the minimum cost of transportation
 SECTION C.
𝑎) A simple queuing system has the mean interval time of 8 minutes and a mean service time of 4
minutes .
i) Determine the mean service rate and the mean arrival rate.
ii) Determine the traffic intensity.
iii) Determine the mean time a customer spends in the queue and in the system .
iv) What is the expected number of customers in the queue and in the system.
v) What is the probability of having at most four customers in the system.

b) In a departmental store, one cashier is there to serve the customers. And the customers
pick up their needs by themselves. The arrival rate is 9 customers for every 5 minutes and
the cashier can serve 10 customers in 5 minutes. Assuming Poisson arrival rate and
Exponential distribution for service rate, find
i.) Average number of customers in the system
ii.) Average time a customer spends in the system
iii.) Average number of customers in the queue or average queue length
iv.) Average time a customer waits before being
served
c) Arrivals at a telephone booth are considered to be Poisson with an average time of 10
minutes between one arrival and the next. The length of a phone call is assumed to be distributed
exponentially with mean of 3 minutes.
i) What is the probability that a person arriving at the booth will have to wait?
ii) What is the average length of the queues that form time to time?
iii) The telephone department will install a second booth when convinced that an arrival
would expect to have to wait at least three minutes for the phone. By how much must
the flow of arrivals be increased in order to justify a second booth?

d) Trucks at a single platform weigh-bridge arrive according to Poisson probability

distribution. The time required to weigh the truck follows an exponential probability distribution.
The mean arrival rate is 12 trucks per day , and the mean service rate is 18 trucks per day.
Determine the following:
i) The probability that no trucks are in the system.
ii) The average number of trucks waiting for service.
iii) The average time a truck waits for weighing service to begin.
iv) The probability that an arriving truck will have to wait for service.
e) Entire queuing system can be described by customers behavior’s as one of its components.
Explain briefly the customer’s behavior giving examples in each case.