Problem1: A dairy firm has three plants located in the state.
The dairy milk
production at each plant is as follows:
Plant 1: 6 million litres, Plant 2: 1 million litres, Plant 3: 10 million litres
Each day, the firm must fulfil the needs of its four distribution centres. The
minimum requirement of each centre is as follows:
Distribution centre 1: 7 million litres, Distribution centre 2: 5 million litres,
Distribution centre 3: 3 million litres and Distribution centre 4: 2 million litres
.
Cost (in hundreds of rupees) of shipping one million litre from each plant to
each distribution centre is given in following table:
Distribution Centre
D1 D2 D3 D4
P1 2 3 11 7
Plant
P2 1 0 6 1
P3 5 8 15 9
Find the basic feasible solution for given problem using Vogel’s
Approximation method/ penalty Method.
Problem2: A computer centre has three expert programmers. The centre
wants three application programs to be developed. The head of the
computer center after carefully studying the programs to be developed,
estimate the computer time in minutes required by required by experts for
application programs as follows:
Programmers
A B C
1 120 100 80
Programs
2 80 90 110
3 110 140 120
Assign the programmers to programs such that the total computer time is
minimum.
Problem 3:
Constraint 1: 50x+100y<=50000
Goal 1: Avg return 9% of total investement
Here: 6%of 50 = 3Rs per share chemical sector
Simillarly: 10% of 100= 10Rs per share in oil ans gas sector
Hence total return= 3*(chemical sector shares)+ 10*(oil and gas sector shares)
3x+10y>= 9% of 50000
3x+10y>= 4500Rs…………………… Goal 1)
Goal2: 100y<=60% of 50000
y<=300……………………………… Goal 2)
Graphical Analysis:
Goal 1: The point of intersection between the first goal equation line
and constraint line is: 250,375
For these two points we get the following result:
3x+10y>= 4500
3*(250)+10*(375)= 4500
Hence we are able to satisfy goal 1, for achieving min 9% return
target
Goal 2: The point of intersection between the second goal equation
line and constraint line is: 400,300
For these two points we get the following result:
(a) 3x+10y>= 4500
3*(400)+10*(300)= 4200
Goal 1 : Not satisfied
(b y<=300
Satisfied
Note: Since we are able to achieve min 9% interest criteria as per
goal 1, with coordinates 250,375 and not with coordinates 400,300
hence we will go with 250, 375 as feasible solution poiints satifying
Goal 1 and we are compromising on Goal 2:
Problem 4: State characteristics of Markov Chain.
There are also several properties that Markov chains can have, including:
1. Irreducibility: Markov chain is irreducible when it is possible to reach
any state from any other state in a finite number of steps.
2. Aperiodicity: A Markov chain is aperiodic when it is possible to reach
any state from any other state in a finite number of steps, regardless
of the starting state.
3. Recurrence: A state in a Markov chain is recurrent if it is possible to
return to that state in a finite number of steps.
4. Transience: A state in a Markov chain is transient if it is not possible
to return to that state in a finite number of steps.
5. Ergodicity: A Markov chain is ergodic if it is both irreducible and
aperiodic and if the long-term behaviour of the system is
independent of the starting state.
6. Reversibility: A Markov chain is reversible if probability of
transitioning from one state to another is equal to the probability of
transitioning from that state back to the original state.
Problem 5: State few applications of Markov Chain.
1: In stock market:
One common application of Markov chains is in the field of economics,
where they can be used to model the behaviour of stock prices. In this case,
the possible states of the system might represent upward or downward
trends in the market, and the transitions between states might be influenced
by various economic factors such as interest rates and the performance of
individual stocks. By analysing the probability of transitioning between
different states, it is possible to make predictions about the future behaviour
of the market.
2: Prediction regarding of spreading of a disease:
Markov chains can be used for modelling biological systems, such as the
spread of a disease through a population. In such case, the states of the
system might represent the number of individuals in a population who are
susceptible, infected, or immune to the disease, and the transitions between
states might be influenced by several factors such as the rate of infection and
the effectiveness of a vaccine. By analysing the probability of transitioning
between different states, it is possible to make predictions about the future
spread of the disease and the effectiveness of various control measures.
3: Weather Prediction:
Sunny, cloudy, foggy, humid
4: Recommendation system:
Recommended contents, products and ads to the user depending upon their
interest and behaviour
5: Transportation
Optimizing traffic flow, optimizing the route etc.
Problem 6: The Markov analysis may be understood as the way of
analysing the past and present movement of some variable in
an effort to forecast the future movement of the same variable.”
Explain this statement with the help of a suitable example from
marketing and personnel.
Problem 7: Explain the following terms:
(i) Markov process
(ii) Transition probabilities
(iii) Matrix of transition probabilities
Problem 8: In a market study it is found that 70% of customer who purchased
Parle-G biscuits will purchase Parle-G in next visit while 30% will ask for Oreo,
on the other side 15% who purchased Oreo will ask for Parle-G biscuits next
time while 85% will ask for Oreo again. Perform Markov iteration for given
problem, explain with help of transition diagram and construct transition
matrix.
Problem 9: Explain the need of goal programming with help of a case study.
Problem 10: Explain Queuing theory with help of an example.
