Scribd
Upload
4 views

assignment-3-2

The document discusses various concepts in queuing theory and optimization methods, including queue capacity, traffic intensity, and the M/M/1 queuing model. It explains the Fibonacci search method, project gradient method, Lagrange multipliers, and the branch and bound method for integer programming. Additionally, it provides examples and calculations related to queuing systems, including expected idle times and average numbers of cars in a parking scenario.

Uploaded by

muktiprasadnayak10
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

assignment-3-2

The document discusses various concepts in queuing theory and optimization methods, including queue capacity, traffic intensity, and the M/M/1 queuing model. It explains the Fibonacci search method, project gradient method, Lagrange multipliers, and the branch and bound method for integer programming. Additionally, it provides examples and calculations related to queuing systems, including expected idle times and average numbers of cars in a parking scenario.

Uploaded by

muktiprasadnayak10
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

ASSIGNMENT-3

1. What do you understand by (i) queue capacity (ii) traffic intensity

Ans: (i) Queue capacity refers to the maximum number of customers or items that can be in
the queue (waiting line) or system at any given time, including those being served.

(ii) Traffic intensity denoted as 𝜌, represents the utilization of a resource, typically measured
as the ratio of the arrival rate (λ) to the service rate (μ). It indicates how busy a system or
𝜆
server is, and is a key parameter in queuing theory. 𝜌 =
𝜇

2. Explain why Fibonacci search method is called sequential search technique.

Ans: the Fibonacci method is called sequential search technique since for each step of
computation we need the help of consecutive Fibonacci sequence so that the ratio will be
50%.

3. What is the importance of project gradient method?

Ans: The importance of project gradient method to find the optimal solution of a nonlinear
objective function subject to linear or non-linear constraints, however the limitation is the
constraints must be in equality form.

4. What is M/M/1 queuing model? Explain

Ans: The M/M/1 queuing model, also known as a single-server queuing system, describes a
system where arrivals follow a Poisson process (Markovian), service times are exponentially
distributed (Markovian), and there's only one server.

5. What is Lagranges multiplier? Why they are used in optimization problem?

Ans: The Lagrange multiplier method is a technique used to find the optimal values of a
function subject to constraints, by transforming a constrained optimization problem into an
unconstrained one using a new variable, the Lagrange multiplier.

6. Define branch and bound method in integer programming problem.

Ans: The Branch and Bound method solves integer programming problems by iteratively
exploring a tree of sub problems, using linear programming relaxations to find upper and
lower bounds, and pruning branches that cannot lead to an optimal integer solution

7. What is Khun-Tucker condition to solve optimization problem?

Ans: Max/Min 𝑧 = 𝑓(𝑥)


such that 𝑔𝑖 (𝑥) = ℎ𝑖 (𝑥) − 𝑏𝑖 = (𝑥1 , 𝑥2 ⋯ ⋯ 𝑥𝑛 )𝑇

𝐿(𝑥, 𝑠, 𝜆𝑖 ) = 𝑓(𝑥) − ∑𝑚 2
𝑖=1 𝜆𝑖 [𝑔𝑖 (𝑥) − 𝑆𝑖 ]

𝜕𝐼 𝜕𝐼 𝜕𝜆
= 0, = 0, 𝜕𝑆 = 0
𝜕𝑥𝑖 𝜕𝜆𝑖 𝑖

8. Solve the IPP by using branch and bound method


max(𝑧) = 2𝑥1 + 3𝑥2
subject to
6𝑥1 + 5𝑥2 ≤ 25
𝑥1 + 3𝑥2 ≤ 10
𝑥1 , 𝑥2 ≥ 0 & integers
9. Solve the IPP by using branch and bound method
max(𝑧) = 10𝑥1 + 20𝑥2
subject to
6𝑥1 + 8𝑥2 ≤ 48
𝑥1 + 3𝑥2 ≤ 12
𝑥1 , 𝑥2 ≥ 0 & integers
10. A TV mechanic finds that the time spent on his jobs has an exponential distribution with
mean 30 minutes, if he repairs sets in the order in which they come in. if the arrival of sets
is approximately poisson with an average rate 10 per right-hour day, what is the mechanics
expected idle time each day? How many jobs are ahead of the average set just brought in?

Ans: It is clear that the T.V mechanics shop opened for 8hr. per day.

Given that,

𝜆 =Averge TV arrival rate per day= 10 sets per day

𝜇 =Average TV service rate per day=8hr/30min=16 sets per day


𝜆
𝜌= = 0.625
𝜇

Probability that the mechanics to be ideal in a day

𝑃0 = 1 − 𝜌 = 0.375

Expected ideal time per day= 8ℎ𝑟𝑠 × 𝜌0 = 8 × 0.375 = 3ℎ𝑟


𝜌
𝐿𝑠 = average TV sets in the system= 1−𝜌 = 2sets
11. A car park contains 10 cars. The arrival of cars is poisson, at a mean rate of 10 per hour.
The length of time each car park is exponential distribution with mean of 0.5 hours. How
many cars are in the park on an average?

Ans: Given that capacity of car parking is 10 cars

𝜆 =Averge arrival rate per hour is 10 cars= 10 cars per hour

𝜇 =Average service rate per hour=2 cars per hour

𝑁 =Capacity of car park=10cars


𝜆
𝜌=𝜇=5

1−𝜌
𝑃0 = = 8.192 × 10−8
1−𝜌 𝑁+1

𝐿𝑠 = average number of cars in the park

∑10
𝑛=0 𝑛𝜌𝑛 = 9.75 = 10 𝑐𝑎𝑟𝑠

12. If customers are arriving at a cafeteria with single server at an average rate of 0.4 per
minute and they are being served at an average rate of 0.6 per minute, then find
(i) The average queuing system
(ii) The average waiting time by a customer in queue

Ans: Given that,


𝜆 =Averge no. of customers arrival rate = 0.4 per minute
𝜇 =Average no. of customers service rate =0.6 per minute
𝜆 0.4 2
𝜌 = 𝜇 = 0.6 = 3
𝜌
𝐿𝑠 = average queuing system= 1−𝜌 = 2
𝜌 10
𝑊𝑞 = =
𝜇−𝜆 3

13. Write short notes of the following


(a) Markovian queuing model

Ans: A Markovian queuing model is a type of queuing model where the time between arrivals
and the service times follow a Poisson distribution, meaning the probability of an arrival or
completion of service in a given time interval depends only on the time elapsed and not on the
past events. This assumption simplifies the analysis of waiting lines and allows for the prediction
of queue lengths and waiting times. Markovian queuing models are often denoted using Kendall's
notation. We deal with following type of Markovian queuing model

M/M/1: A single-server queuing system with Poisson arrivals and exponential service times.

M/M/c: A queuing system with multiple servers, where arrivals and service times are
exponentially distributed.

(b) Lagrange multipliers in constrained optimization problem

Ans: The Lagrange multiplier method is a technique used to find the optimal values of a function
subject to constraints, by transforming a constrained optimization problem into an unconstrained
one using a new variable, the Lagrange multiplier.

maximize or minimize a function f(x, y, z) given a constraint g(x, y, z) = k.


Lagrangian:
L(x, y, z, λ) = f(x, y, z) - λ(g(x, y, z) - k).
Solving:
Find the values of x, y, z, and λ that satisfy the partial derivatives of L with respect to all
variables (including λ) are equal to zero.
Solution:
The values of x, y, and z found in this way are the potential local extrema of the
function f subject to the constraint g = k.
14. The rate of arrival of customers at a public telephone booth follows poisson distribution
with an average time of 5 min. between one customer and the next. The duration of a
phone call is assumed to follow exponential distribution with mean time of 4 min.
(i) What is the probability that a person arriving at the booth will have to wait
(ii) Estimate the fraction of the day that the phone will be in use.

Ans: Arrival time is an average time of 5 minutes between one customer


60
So, arrival time 𝜆 = = 12 customers per hour
5
60
Similarly, service time 𝜇 = = 15 customers per hour
4
𝜆
𝜌 = 𝜇 = 0.8

(i) The probability that a person arriving at the booth will have to wait is
𝑃0 = 1 − 𝜌 = 0.2
(ii) Estimate the fraction of the day that the phone will be in use
𝜆
=utilization factor 𝜌 = = 0.8
𝜇

You might also like