Roll. No.

Shiv Nadar University Chennai, Kalavakkam - 603 110

(A State Private University)
School of Engineering
Department of Computer Science and Engineering
Contin uous Assessment Test - I
Name of the Program
& Branch B. Tech Al & DS Semester: V
Course Code & Name MA3001& OptimizationTechniques Date: 09/08/2023
Time: 60 Minutes
(11:50 AM - 12:50 PM) Answer All Questions Maximum: 20 Marks

Q. No. Questions Marks CO KL

Write the standard form of Min z = 6x1 + 9x2 + x3 subject to
1

+ 12; + 5X2 - 2X3

3 C02 KL3
20;4X1 + 9; Xl,X3 20.

A company making cold drinks has two bottling plants located at towns
Tl and T2. Each plant produces three drinks A,B,C and their production
capacity per day is given below:

Cold drinks
Plantat

2 6000 2000
1000 2500 3 COI KL3
3000 3000

The marketingdepartmentof the companyforecasts a demandof

80,000 bottles of A, 22,000 bottles of B, and 40,000 bottles of C. The
operating costs per day of plants at Tl and T2 are Rs.6000 and Rs.4000
respectively. Formulate this as LPP to minimize the operating costs
while meeting the market demand.
3 (a) Find the graphical solution of Max z = 6x1 + 10x2 subject to 6 COI KL3
2X1 +X2 50; + 5X2 100; 2X1 + 90; 2 0 and

(b) Solve the above LPP in 3(a) using simplex method. Hence, identify 8 C02 KL3
the path of the simplex method and the basic and non-basic variables
that define this path.

Q/ KL - Bloom's Taxonomy Levels (KLI: Remembering, KL2: Understanding, KL3: Applying,

KL4: Analyzing, KL5: Evaluating, KL6: Creating); CO - Course Outcomes
12
 Shiv Nadar University Chennai
Mid Semester Examinations 2023-2024 Odd
Question Paper
Name of the Program: B. Semester: V
Tech. Al & DS
Course Code & Name: MA3001
OPTIMIZATION TECHNIQUES
Regulation 2021
Time: 2 Hours Answer All Questions Maximum: 50 Marks

Q.NO Questions Marks co

1 Suppose a media specialist must decide how to allocate advertising in three 3 COI KL3
media vehicles. Let Xi be the number of messages carried in the media per
year, i = 1, 2, 3. The unit costs of a message in the three media are t 1000,
e 750, and FOO. The total budget available for the campaign is 000000
for the period of a year. The first media is a monthly magazine, and it is
desired to advertise not more than one insertion in one issue. At least six
messages should appear in the second media. The number of messages in
the third media should strictly lie between 4 and 8. The expected effective
audience for unit message in the media vehicles is shown below.
Vehicle Expected Effective Audience
1 80000
2 60000
3 45000
Formulate this problem as LPP to determine the optimum allocation that
would maximize total effective audience.
2 Consider a linear programmingproblem with two variables and two 3 co1 KL4
constraints. The objective function is: Maximize Xl + X2. The corner
points of the feasible region are (0, 0), (0, 2) (2, 0) and (4/3, 4/3). If an
additional constraint Xl+X2 5 is added, find the optimal solution of the
problem.
3 Comment on the optimal solution of the maximization LPP which 3 C02 KL3
possesses the following simplex iteration. Find an alternate solution if it
exists.
Basic RHS
1/2 1 0 5/2

1/2 0 -1/2 1 3/2

z 0 0 2 10

4 Find all the basic solutions of the following LPP 3 C02 KL3
Max z = 5x1 + 3x2 subject to 3x1 + 5x2 15; 5x1 + 2x2 10;
Xl 2 0 and x2 2 0. Why do we choose the values of non-basic variables
as zero while finding basic solution?
 5 A tax consulting firm has a service counter in its office for receiving 3 C05 KL3
people who have problems and complaints about their income, wealth, and
sales taxes. The average arrival is 80 people in an 8-hour service day. The
tax adviser spends an irregular amount of time servicing the arrivals, which
have been found to have an exponential distribution, The average service
time is 20 minutes. Calculate how many hours the tax adviser spends
performing his job each week.
6 Use graphical method to solve the following LPP: 8 co 1 KL3

Min z = Xl + -x2 subject to 3x1 + 2x2 12; 5x1 = 10

Xl + X2 8; —Xl+ X2 4; Xl 2 0 and X2 2 0.
7 Use penalty method to solve the following LPP: 10 C02 KL3
Max z = 2x1 + 3x2 + 4x3 subject to 3x1 + x2 + 4x3 600;
2X1 + 4X2 + 2X3 480; 2X1+ 3X2+ 3X3 = 540; Xl 2 0,X2 2 0 and

8 Solve the following LPP using simplex method 10 C02 KL3

Max Z = 3X1 + 9X2 subject to Xl + 4X2 8; Xl + 2X2 4; Xl 2 0
and x2 2 0.
do you infer from the optimal solution of the above LPP?
9 Customers arrive at a sales counter staffed by a single person according to 7 cos KL3
Poisson process with a mean rate of 20 per hour. The time required to serve
a customer has an exponential distribution with a mean of 100 seconds.
Find (i) the average waiting time of a customer, (ii) the probability that
queue size exceeds 4 and (iii) proportion of the time that the counter is
expected to be idle.

KL —Bloom's Taxonomy Levels

(KLI: Remembering, KL2: Understanding,KL3: Applying, KL4: Analyzing,
KL5: Evaluating, KL6: Creating)
CO —Course Outcomes
 Roll. No.

Shiv Nadar University Chennai, Kalavakknm - 603 110

(A State Private University)
School of Enginccring
Department of Computer Science and Engineering
Continuous Assessment Test ---Il
Name of the Program
B. Tech Al & DS Semester: V
& Branch
Course Code & Name MA3001 & Optimization Techniques Date: 18/10/2023
Time: 60 Minutes
Answer All Questions Maximum: 20 Marks
(11:50 AM 12:50 PM)

Q. No. Questions Marks CO KL

1 Suppose that the system capacity of multi-server and infinite 6 COS KL3
population model is limited to 'N' and the steady state probabilities of
pnpo
'n' customers in the system are given by pn = p nPO

Compute the expected number of customer; in the queue. Also, explain

the relationship between effective arrival rate and nominal arrival rate.

2 Express the following transportation problem as LPP and find the 6 C03 KL4
starting basic feasible solution using Northwest-corner rule, least cost
method, and Vogel's approximation method. Also, compare the
solutions obtained from the above three methods.
Supply
1 2 6 7

O 4 2 12

3 1 5 11

Demand 10 10 10

3 The steady state probabilities pn of n customers in the system for an 8 COS KL4
(M/ M/ 1): (FIFO/5 / 00) are given in the following table:

n o 1 2 3 4 5
0.399 0.249 0.156 0.097 0.061 0.038

The arrival rate A is five customers per hour. The service rate g is
eight customers per hour, Compute the following:
(Pfo)

page 1 of 2
 (i). Probability that an arriving customer will be able to enter the
system.
(ii). Rate at which arriving customers will not be able to enter the
system.
(iii). Expected number of customers in the system.
(iv). Average waiting time in the queue

KL - Bloom's Taxonomy Levels (KLI: Remembering, KL2: Understanding, KL3: Applying,

KL4: Analyzing, KL5: Evaluating, KL6: Creating); CO - Course Outcomes
 Shiv Nadar University Chennai
End Semester Examinations, 2023-2024 Odd
Question Paper
Name of the Program: B.Tech. Al & DS Semester: V
Course Code & Name: NIA3001 OPTIMIZATION TECHNIQUES
Regulation 2021
Time: 3 Hours Answer All Questions Maximum: 100 Marks
USE OF STATISTICAL TABLES ARE PERMITTED
Q.NO Questions Marks
I a An investor has t2000000 with her and considers three schemes to invest the 3 COI KL4
money for one year. The expected returns are 10%, 12% and 15% for the
three schemes per year. The third scheme accepts only up to Z1000000. The
investor wants to invest more money in scheme I than in scheme 2. The
investor assesses the risk associated with the three schemes as 0 units,
10 units and 20 units per lakh invested and do not want her risk to exceed
500 units. Formulate this problem as the Linear Programming Problem (LPP)
to get the maximum total return.
b Identify the (i) binding constraints, (ii) relevant constraints and 3 co 1 KL3
(iii) redundant constraints from the following graph, if the corner point C
provides the optimum solution of the LPP.

6 + 4x2 s 24
Xl+ 2X2 6 @
5
1
4
3
3 2
4
2

o 1 2 3 4 6
2 a Express the following LPP in standard form 3 C02 KL3
Max Z = Xl + 3x2 7x3 subject to the constraints
Xl —X2+ 3X3 2 2; —X2+ .3X3= 8;
Xl —2X2 + X3 11 and
x2 0, Xl and x3 are unrestricted.
b Find all the basic solutions
of the following LPP 3 C02 KL3
Max z = Xl + 3x2 subject to 2x1
+ x2 5; 5x1 + 2x2 8;
Xl andX2 0.

Page 1 of 4
 C03
a A dairy farm has three plants located in a state. The daily milk production (in
3 KL3
3
million litres) at Plants PI, P2 and are 6 units, I unit and 10 units
respectively. Each day, the farm must fulfil the needs of its four distribution
Centres
centres. The minimum requirement (in million litres) of Distribution
DI, , D3 and are 7 units, 5 units, 3 units and 2 units respectively. Cost
each
(in hundreds of rupees) of shipping one million litre from each plant to
distribution centre is given in the following table. Find the starting basic
feasible solution using least cost method.

2 3 11

5 8 15
C03
b Consider the problem of assigning four jobs to four machines. The
3 KL3

assignment costs are given as follows. Write the LPP formulation and find
the optimal assignment.
Jobs

1 11 111 IV

Machines A 10 5 13 15

9 18

c 10 7 3 2

11

C04 KL4
a Construct the network for the project whose activities and precedence
3
4
activities are as follows.
Activity
Predecessor
C04 KL3
b For each activity in the following project network, the three time estimates
3

to, tm, tp are given along the arrows in the to m —tp order. Determine the
critical path.
14 - 17 - 20
2

40
O

COS KL3
a A small post office has two open windows. The arrival of the customers
3
5
follows Poisson distribution with the rate of I for every 3 minutes, The
service time per customer is exponential with a mean of 5 minutes. All
arriving customers from one line and access the available windows on a
FIFO basis. What is the probability that an arriving customer will wait in
line?

Page 2 of4
 b A cafeteria has three service counters and can accommodate only 7 3 cos KL3

customers (including the customers being served). Customers arrive in a

Poisson stream at the rate of 10 per hour and are served at the rate of 12 per
hour. Find the probability that the cafeteria is empty.
a Use graphical method to solve the following LPP: 5 COI KL3
6
Max z = 80x1 + 120x2 subject to the constraints Xl + x2 9;

2; 3; + 360; and X22 0,

7 Solve the following LPP using simplex method 8 C02 KL3

Max z = 3x1 + 2x2 + 5x3 subject to Xl + 4x2 420;

3X1 + 2X3 460; + 2X2 + X3 and X3 0.

Estimate the optimal transportation cost of the following transportation 12 C03 KL3
8
model.
Supply
4 1 2 6 9 100

6 4 3 5 7 120
5 2 6 4 8 120

Demand 40 50 70 90 90

b Four different operators must be assigned to four different machines. The 8 C03 KL3

cost matrix is given as follows. How should the operators be assigned to the
various machines so that the total cost is minimized (Use Hungarian
method)?
Operators
B c
1 1 4 6 3

Machines 11 9 7 10 9

111 4 5 11 7

IV 8 7 8 3

9 a Consider a project with the following activities and its durations. 10 C04 KL4

Activity 1-2 1-3 2—4 3—4

Time 6 5 10 3

Activity 3-5 4—5 4—6 5-6

Time 4 6 2 9

i. Draw the network of the project and identify the critical path.
ii. Compute Earliest Start, Earliest Finish, Latest Start, Latest Finish, Total
Float and Free Float times of the activities.

Page 3 of 4
 10 C04 KL4
b A project consists of the following activities and time estimates (in weeks).
Activity 1 —2 1-3 2-5 3-5 4—6 5-6
2 2 3
to 1 1 2
4 1 5 5 6
t 2
7 14 8 15
7 8 1
and
Construct the project network and find the expected duration
i.
variance of each activity.
ii. Determine the critical path and expected project length.
within 20
iii. What is the probabilitythat the project will be completed
weeks?
iv. What due date has about 90% chance of being met?
Poisson 12 COS KL4
10 a A restaurant has one drive —in window. Cars arrive according to a
of the
distribution at the rate of 2 cars every 5 minutes. The space in front
served.
window can accommodate at most@pars, including the one being
customer is
Other cars can wait outside if necessary. The service time per
that
exponential with a mean of 1.5 minutes. Determine (i) the probability
the
the facility is idle, (ii) the effective arrival rate and the rate at which
customer will not be able to enter the system (iii) the expected number of
customers waiting to be served and (iv) the probability that there is no queue.
5 COS KL4
b A branch of Punjab National bank has only one typist. Since the typing work
varies in length (number of pages typed), the typing rate is randomly
distributed approximating a Poisson distribution with mean service rate of 8
letters per hour. The letters arrive at a rate of 5 per hour. Find (i) the
proportion of time that the typist is busy, (ii) probability that the queue size
exceeds 10.

KL —Bloom's Taxonomy Levels

Evaluating, KL6: Creating)
(KLI: Remembering, KL2: Understanding, KL3: Applying, KL4: Analyzing, KL5:
CO —Course Outcomes