2021

S K Mondal
10. Consider a single machine workstation to which jobs arrive according to a Poisson distribution with a
mean arrival rate of 12 job/hour. The process time of the workstation is exponentially distributed with a
mean of 4 minutes. The expected number of jobs at the workstation at any given point of time is _____
(round off to the nearest integer).
Key: (4)
Sol: Mean arrival rate,     12 jobs/hour

1 60
Mean service rate,     minutes =  15 jobs / hour
4 4
Expected number of jobs at the work station = length of system = LS
 12 12
LS     4 jobs
     15  12  3
17. Customers arrive at a shop according to the Poisson distribution with a mean of 10 customers/hour. The
manager notes that no customer arrives for the first 3 minutes after the shop opens. The probability that a
customer arrives within the next 3 minutes is
(A) 0.61 (B) 0.50 (C) 0.39 (D) 0.86
Key: (C)
10 1
Sol: 10 customers in 1 hour,   
hr 6  min 

For 3 minutes, T  0.5;

Probability of zero customers in first 3 minutes
Probability of zero customers in first 6 minutes
T
.  T 
0
e
P  X  0  eT . T 
0
 e0.5  0.606
0! P  X  0   e 1  0.3679
0!
Probability of one customer in first 3 minutes
Probability of one customer in first 6 minutes
T
.  T 
1
eT . T 
e
P  X  1 
1
 e0.5 .0.5  0.303
1! P  X  1   e1.1  0.3679
1!
It can be observed that probability of one customer in first 3 minutes is greater than probability of one
customer in first 3 minutes.
It can be observed that probability of zero customers in first 6 minutes is equal to probability of one
customer in first 6 minutes.
Now, we want probability one customer in between 3 to 6 minutes provided zero customers in first 3
minutes.
Here, logic one should observe is irrespective of first 3 minutes customers‟ arrival, Probability of one
customer in 6 minutes is 0.3679 which is nothing but can be assumed as 1 customer in between 3 minutes
to 6 minutes.(As already given no customers in first 3 mins)
Thus, 3min  P  x  1  6 min
 0.3679 ~ 0.39
 2021
S K Mondal
22. Robot Ltd. wishes to maintain enough safety stock during the lead time period between
starting a new production run and its completion such that the probability of satisfying the
customer demand during the lead time period is 95%. The lead time periods is 5 days and
daily customer demand can be assumed to follow the Gaussian (normal) distribution with mean
50 units and a standard deviation of 10 units. Using 1  0.95   1.64, where  represents the cumulative
distribution function of the standard normal random variable, the amount of safety
stock that must be maintained by Robot Ltd. to achieve this demand fulfillment probability for
the lead time period is _____ units (round off to two decimal places).
Key: (332)
x 
Sol: In normal distribution, Z 

Given, P  X  0.95  1.64
x  50
Thus, 1.64   x  66.4 ~ Demand
10
So, safety stock ~ Lead Time Demand
  Demand    Lead Time   66.4  5  332

27. Activities A, B, C and D from the critical path for a project with a PERT network. The means and
variances of the activity duration for each activity are given below. All activity durations follow the
Gaussian (normal) distribution and are independent of each other.
Activity A B C D
Mean (days) 6 11 8 15
Variance (days2) 4 9 4 9
The probability that the project will be completed within 40 days is ____ (round off to two decimal
places). (Note : Probability is a number between 0 and 1)
Key: (0.5)
Sol: Sum of variances of all activities in critical path  4  9  4  9  26days

Standard deviation of all activities in critical path  26  5.099  5.1

X = No. of days project to be completed = 40
  Mean days for completing project  6  11  8  15  40days

X   40  40
Z  0
 5.1
Probability for Z = 0 is 50% i.e., 0.5
 2021
S K Mondal
44. A set of jobs, A, B, C, D, E, F, G, H arrive at time t = 0 for processing on turning and grinding
machines. Each job needs to be processed in sequence – first on the turning machine and second on the
grinding machine, and the grinding must occur immediately after turning. The processing times of the
jobs are given below.
Job A B C D E F G H

Turning (minutes) 2 4 8 9 7 6 5 10

Grinding 6 1 3 7 9 5 2 4
(minutes)
If the makespan is to be minimized, then the optimal sequence in which these jobs must be
processed on the turning and grinding machine is
(A) G-E-D-F-H-C-A-B (B) B-G-C-H-F-D-E-A
(C) A-E-D-F-H-C-G-B (D) A-D-E-F-H-C-G-B
Key: (C)
Sol:
M1 M2
M1 M2
A E D F H C G B
Turing Grinding
Job
(Minutes) (Minutes)
4 If least time taken job is to perform on machine
2 6
(M1) should be performed first and place at near to M1.
B 4 1
If least time taken job is to perform on machine 2 (M2
C 8 3 ) should be performed at last and placed near to M2.
D 9 7 If tie occurs first place near to machine 1 (M1)
E 7 9 So the optimal sequence is A E D F H C G B.

F 6 5

G 5 2

H 10 4
 2021
S K Mondal
15. Daily production capacity of a bearing manufacturing company is 30000 bearings. The daily demand of
the bearing is 15000. The holding cost per year of keeping a bearing in the inventory is Rs. 20. The
setup costfor the production of a batch is Rs.1800. Assuming 300 working days in a year, the economic
batch quantity in number of bearing is ______. (in integer).
Key: (40250)
Sol: Daily Demand = 15,000 bearings
Annual Demand (R) = 15,000 × 300
C3  ordering cost (or) set up cost = 1800 Rs
C1  carrying cost = 20 Rs|Bearing|year
K = Production rate = 30, 000, Bearings per day
2C3 R 2C3 R  k 
Economic batch quantity  EBQ     
 R C1  k  R 
C1 1  
 K

 2  1800  15,000  300   30,000 

   
 20   30,000  15,000 
 40249.2 units

17. A PERT network has 9 activities on its critical path. The standard deviation of each activity on the
critical path is 3. The standard deviation of the critical path is
(A) 3 (B) 81 (C) 9 (D) 27
Key: (C)
Sol: Variance of each activity in the critical path  2  9
Sum of variances of all activities in the critical path  92  9  9  81
Standard deviation of critical path  81  9
 2021
S K Mondal
34. A factory produces m  i  1, 2,.......m  products, each of which requires processing on n  j  1, 2......, n 
workstations. Let ai,j be the amount of processing time that one unit of the ith product requires on the jth
workstation. Let the revenue from selling one unit of the ith product ri and hi be the holding cost per unit
per time period for the ith product. The planning horizon consists of T  t  1, 2.....,T  time periods. The
minimum demand that must be satisfied in time period t is dit , and the capacity of the jth workstation in
time period t is c jt . Consider the aggregate planning formulation below, with decision variable Sit
(amount of product i sold in time period t), X it (amount of product i manufactured in time period t) and
Iit (amount of product i held in inventory at the end of time period t).
T m
max   rS
i it  h i Iit  subject to
t 1 i 1

Sit  dit  i, t
 capacity constraint 
 inventory balance constraint 
Xit, Sit, Iit  0; Ii0  0

The capacity constraints and inventory balance constraints for this formulation respectively are
m m
(A)  aijXit  c jt  i, t and Iit  Ii, t 1  Xit  dit  i, t (C)
i
a X
i
ij it  dit  i, t and Iit  Ii, t 1  Xit  Sit  i, t

m m
(B) a X
i
ij it  c jt  j, t and Iit  Ii, t 1  Xit  Sit  i, t (D) a X
i
ij it  d jt  i, t and Iit  Ii, t 1  Sit  Xit  i, t

Key: (B)
Sol: Capacity constraint is
a ij x it  c jt

Where, a ij  processing time that one unit of ith product requires on jth work station

x it  Amount of product ‘i’ manufacture in time period ‘t’.

C jt  Capacity work station ‘j’ in time ‘t’

Inventory balance constraint is

Iit  Ii,t 1  x it  sit

Where, Iit  Amount of product ‘i’ held in inventory at the end of time period ‘t’
Ii,t 1  Amount of product ‘i’ held in inventory at the time period ‘t–1’

Xit  Amount product ‘i’ manufacture in time period ‘t’

Ii,t 1  Amount of product ‘i’ held Inventory at the time period ‘t-1’

Xit  Amount product ‘i’ is manufactured in time period ‘t’

Sit  Amount of product ‘i’ sold in time period ‘t’.
 2021
S K Mondal
38. The demand and forecast of an item for five months are given in the table.

Month Demand Forecast

April 225 200

May 220 240

June 285 300

July 290 270

August 250 230

The mean absolute percent error (MAPE) in the forecast is _____________%. (round off to two decimal
places)

Key: (8.07)
Sol:
Percentage absolute
Month Demand (D) Forecast (F)  D-F 
error  
 D 
25
April 225 200  11.11%
225
20
May 220 240  9.09%
220
15
June 285 300  5.26%
285
20
July 290 270  6.89%
290
20
August 250 230  8%
250
Mean absolute percentage
11.11  9.09  5.26  6.89  8
error   8.07%
5
 2020
S K Mondal
9. In Materials Requirement Planning, if the inventory holding cost is very high and the setup
cost is zero,which one of the following lot sizing approaches should be used?
(A) Base Stock Level (B) Lot-for-Lot
(C) Economic Order Quantity (D) Fixed Period Quantity, for 2 periods
Key: (B)
Sol: Lot for lot approach will be used when setup cost (or) ordering cost is negligible
level compared to inventory cost.

16. Consider the following network of activities, with each activity named A–L, illustrated
7
in the nodes ofthe network.
F 8
The number of hours required for each activity is shown alongside I
the nodes.The slack on the activityL, is __________hours. 5

J
Key: (2)
6
2 4 10 4
Sol: A B K FINISH
START C E

23 23
31 31
L
2
36 36
EPT LFT 16 16 D G H

6 7 9

20 31 42 42

2 6

22 24

29 31
38 40 40 42

EFT = Earliest finish time LFT = Latest finish time EST = Earliest start time
LST= Latest start time. The critical path for the given project is A − B − C − F − I − J − K
and time taken is 42 hours. EFT and LFT of each activity is shown along the nodes.
Slack (or) Float of any activity = LFT – EFT (or) LST – EST
Slack ( or ) float of activity 'L ' is = 42 − 40 = 2 hours.
 2020
S K Mondal
37. The forecast for the monthly demand of a product is given in the table below.
The forecast is made by using the exponential Month Forecast Actual Sales
smoothing method. The exponentialsmoothing 1 32.00 30.00
coefficient used in forecasting the demand is 2 31.80 32.00
(A) 0.10 (B) 1.00 3 31.82 30.00

(C) 0.40 (D) 0.50

Key: (A)
Sol: We know that, in exponential forecasting method Ft +1 = Ft +  ( D t − Ft )
F1 = 32, D1 = 30 and F2 = 31.80
F2 = F1 +  ( D1 − F1 ) 31.80 = 32 +  ( 30 − 32 )   = 0.1
F2 = 31.80, D2 = 32 and F3 = 31.82
F3 = F2 +  ( D2 − F2 ) 31.82 = 31.80 +  ( 32 − 31.80 )   = 0.1

46. For a single item inventory system, the demand is continuous, which is 10000 per year. The
replacementis instantaneous and backorders (S units) per cycle are allowed as shown in the figure.
Inventory
As soon as the quantity (Q units) ordered from the supplier is received,
the backordered quantity isissued to the customers. The ordering cost
is Rs. 300 per order. The carrying cost is Rs. 4 per unit peryear. The cost
of backordering is Rs. 25 per unit per year. Based on the total cost
minimization criteria,the maximum inventory reached in the system
is ________ (round off to nearest integer).

Time
S

Key: (1137.15)
Sol: Given that, Annual demand ( R ) = 10,000 units year Q

Carrying cost ( CC ) = Rs. 4/unit/year 

Invertory
Ordering cost ( Co ) = Rs 300 / order ( units )

Back order cost (or) shortage cost ( Cs ) = Rs. 25/unit/year

Qs

Economic order quantity when shortage is allowed is → Time

 2C R  C + CC   2  300  10,000  25 + 4 
EOQ =  o  S =   
 CC  CS   4  25 

EOQ = Q* = 1319.09 units

 CC   4 
Optional shortage level Q*S = Q*   = (1319.09 )   = 181.94 units
 CS + C C   25 + 4 

 Maximum amount of inverting level = Q* − Q*S = 1319.09 − 181.94 = 1137.15 units

 2020
S K Mondal
25. In the Critical Path Method (CPM), the cost-time slope of an activity is given by
Normal Cost Crash Cost − Normal Cost
(A) (B)
Crash Time − Normal Time Normal Time − Crash Time

Crash Cost − Normal Cost Crash Cost

(C) (D)
Crash Time Crash Time − Normal Time .
Key: (B)
Sol:
( crash cost − normal cost )
Cost-time slope for crashing an activity =
( normal time − crash time )

33. For an assembly line, the production rate was 4 pieces per hour and the average processing
time was 60 minutes. The WIP inventory was calculated. Now, the production rate is kept
the same, and the average processing time is brought down by 30 percent. As a result of
this change in the processing time, the WIP inventory.
(A) decreases by 25% (B) increases by 30%
(C) increases by 25% (D) decreases by 30%
Key: (D)
Sol: In first case,
Production rate = 4/hour
Processing time = 60 minutes = 1 hour
Production per one hour = 4 × 1 = 4 units
In second case,
Production rate = 4/hour
Processing time reduced by 30%
 New processing time = 0.7 × hour
New production per one hour = 4 × 0.7 = 2.8 units
4 − 2.8
Work in progress (WIP) has been reduced and hence decrease in WIP =  100 = 30%
4
 2020
S K Mondal
27. Consider two cases as below.
Case 1: A company buys 1000 pieces per year of a certain part from vendor ‘X’. the changeover time is
2 hours and the piece is Rs. 10 per piece. The holding cost rate per part is 10% per year.
Case 2: For the same part, another vendor ‘Y’ offers a design where the changeover time is 6 minutes,
with a price of Rs. 5 per piece, and a holding cost rate per part of 100% per year. The order size is 800
pieces per year from ‘X’ and 200 pieces per year from ‘Y’.
Assume the cost of downtime as Rs. 200 per hour. The percentage reduction in the annual cost for Case
2, as compared to Case 1 is _________ (round off to 2 decimal places).
Key: (30.91)
Sol: Annual demand of pieces ( A ) = 1000 pieces year cost of down time=200 Rs. per hour

For case 1:
Changeover time =2 hours ordering cost ( Co ) = 2  200 = 400 Rs.

Holding cost rate ( CC ) = 10% of piece cos t = 0.1 10 =1 Rs per piece per year

Number of pieces order from vendor ‘x’ ( Q ) = 800 pices

Annual cost = cost of all pieces + carrying cost + ordering cost

 A A  1000   1000 
= ( C  A ) +  CC   +   ( C0 ) = (10  1000 ) + 1  +  ( 400 ) = 11000 Rs.
 2  Q  2   800 
For case 2:
Change over time = 6 minutes =0.1 hour
Price pieces ordering cost = 5per cos t pices ( C0 ) = 0.1  200 = 20Rs.

Holding cost rate ( CC ) = 100% of piece cos t = 1  5

Or carrying cost = 5 Rs per year

Number of pieces ordered from vendor ‘y’ = ( Q ) = 200 pieces

Annual cost= cost all pieces + carrying cost + ordering cost

A A
= C  A + CC  + C0
2 Q
 1000   1000 
= ( 5  1000 ) +  5  +  ( 20 ) = 7600 Rs
 2   200 

 11000 − 7600 
% Decrese in cos t =    100 = 30.91%
 11000 
 2020
S K Mondal
40. Two business owners Shveta and Ashoka run their business in two different states. Each of them,
independent of the other, produces two products A and B, sells them at Rs 2,000 per kg and Rs. 3, 000
per kg, respectively, and uses Linear Programming to determine the optimal quantity of A and B to
maximize their respective daily revenue. Their constrains are as follows:
(i) for each business owner, the production process is such that the daily production of A has to be at
least as much as B, and the upper limit for production of B is 10 kg per day, and
(ii) the respective state regulations restrict Sheveta’s production of A to less than 20 kg per day, and
Ashoka’s production of A to less than 15 kg per day. The demand of both A and B both the states is
very high and everything produced is sold.
The absolute value of the difference in daily (optimal) revenue of Shveta and Ashok is ________
thousand Rupees (round off to 2 decimal places).
Key: (10)
Sol: Given that,
Revenue per unit of ‘A’ = 2000 Rs,Revenue per unit of ‘B’ = 3000 Rs
Let x = Number of units of ‘A’ product y = Number of units of ‘B’ product
Common constraint given are x  y …(1) y
y  10
For Ashok’s business, y  10 …(2) D C
y = 10
The extra constraint is x  15 …(3)
Feasible region
Then from (1), (2) and (3), we can write, A B
10
Constraints for Ashok ‘S’ becomes 10  x  15 and y  10 14 x
10  x  15
The feasible region for Ashok business

At A = (10,0 ) , revenue of Ashok = ( 2000 10 + ( 0 )( 3000 ) ) = 20,000Rs

At (B = 14, 0) (since x < 15) revenue of Ashok = ( 2000  15) + ( 0 )( 3000 ) = 30,000 Rs

At C = 14, 10 revenue of Ashok = ( 2000  14 ) + (10 )( 8000 ) = 58,000 Rs

At D = (10, 10), revenue of Ashok = ( 2000  10 ) + ( 3000  10 ) = 50,000 Rs

 Maximum revenue of Ashok = 58, 000 Rs.

Similarly, for Shveta business,
The extra constrain is x < 20 …(4)
Hence from (1), (2) and (4), we can write constrains are
10  x  20 and y  10
The feasible region for Shveta business is
 2020
S K Mondal
At point ‘A’ = (10, 0), revenue is Shveta = (10  2000 ) + ( 0  3000 ) = 20,000 Rsy
y  10
At point ‘B’ = (19, 0), revenue of Shveta = (19  2000 ) + ( 0  300 ) = 38,000 Rs D C
y  10
At point ‘C’ = (19, 10), revenue of Shveta = (19  2000 ) + (10  300 ) = 68,000 Rs
Feasible region
At point ‘D’ = (10, 10), revenue of Shveta = (10  2000 )  (10  3000 ) = 50,000 Rs A B
10 19
x

10  x  20
Maximum revenue of Shveta is = 68,000 Rs
Difference of maximum revenue of Shveta and Ashok Business is = 68,000 – 50,000 = 10,000 Rs.
 2019
S K Mondal‟s
4. The table presents the demand of a product. By simple three-months moving average method,
the demand-forecast of the product for the month of September is

(A) 490 (B) 536.67 Month Demand

January 450
(C) 510 (D) 530
February 440
Key: (C) March 460
April 510
Sol: Forecast of the product of the month May 520
June 495
495  475  560
September =  510 July 475
3
August 560

5. The lengths of a large stock of titanium rods follow a normal distribution with a mean    of

440 mm and a standard deviation    of 1 mm. What is the percentage of rods whose lengths lie

between 438 mm and 441 mm?

(A) 86.64% (B) 68.4% (C) 99.75% (D) 81.85%
Key: (D)

Sol: Given , Mean     440mm, S.D     1 mm

The random variable ‘X’ denotes lengths of rods.
P  438  X  441  ?
X
The standard normal variable Z  Z 1 Z  2
 Z  2 Z  1 Z  0
438  440
If X  438  Z   2 68.26%
1
441  440 95.44%
If X  441  Z  1
1
 P  438  X  441  P  2  Z  1  P  2  Z  0  P 0  Z  1
 95.44   68.26 
  %   2  %   47.72  %   34.13 %
 2   
 P  438  X  441  81.85%
 2019
S K Mondal‟s
27. A project consists of six activities. The immediate predecessor of each activity and the
estimated duration is also provided in the table below:
Activity Immediate predecessor Estimated duration (weeks)
P - 5
Q - 1
R Q 2
S P, R 4
T P 6
U S,T 3

If all activities other than S take the estimated amount of time, the maximum duration (in
weeks) of the activity S without delaying the completion of the project is ____________.
Key: (6)

Sol: From the given data, we can represent network flow as follows

T 6
1
P 5
U  3
1 6
1
Dummy  0 

Q 1 R  2 S 4
1 1

Considering path 1-2-5-6, time taken will be = 5+ 6+ 3= 14 weeks

Considering path 1-2-4-5-6, time taken will be=5+0+4+5=12 weeks.
Considering path 1-3-4-5-6, time taken will be = 1+2+4+3 =10 weeks
Maximum time taken is 14 weeks, so ‘2’ weeks can be delayed so that 1-2-4-5-6 path will also
take 14 weeks.
So answer is 4 weeks +2 weeks = 6 weeks
Duration can be given for activities without delay the project.
 2019
S K Mondal‟s
49. Five jobs (J1, J2, J3, J4 and J5) need to be processed in a factory. Each job can be assigned to any
of the five different machines (M1, M2, M3, M4 and M5). The time duration taken (in minutes)
by the machines for each of the jobs, are given in the table. However, each job is assigned to a
specific machine in such a way that the total processing time is minimum. The total processing
time is _____ minutes.
M1 M2 M3 M4 M5

Key: (146) J1 40 30 50 50 58

J2 269 38 60 26 38
Sol: This problem can be solved by
assignment problem J3 40 34 28 24 30

J4 28 40 40 32 48

J5 28 32 38 22 44

Row minimization matrix is Column minimization matrix is

10 0 20 20 28 10 0 16 20 22
0 12 34 0 12 0 12 30 0 6
16 10 4 0 6 16 10 0 0 0
0 12 12 4 20 0 12 8 4 14
6 10 16 0 22 6 10 12 0 16

In the above matrix all zeros can The least value in the uncrossed calls is 8.
be coved with only four lines as follows It is subtracted from the uncrossed cell and
added for the intersection of the vertical line
and horizontal lines
10 0 16 20 22
18 0 16 28 22
0 12 30 0 6
0 4 22 0 6
16 10 0 0 0
24 10 0 8 0
0 12 8 4 14
0 4 0 4 14
6 10 12 0 16
6 2 4 0 16

Since the above matrix can only be

covers with ‘5’ lines the assignment
can be done as follows
M1 M2 M3 M4 M5 Assignments of jobs are
J1 18 0 16 28 22 J1  M 2 J 2  M1 J3  M5 J 4  M3 J5  M4
J2 0 4 22 0 6
J3 24 0 0 8 0 30 38 28 28 22
J4 0 4 0 4 14
J5 6 2 4 0 16

 Total processing time = 30 + 38 + 28 + 28 + 22 = 146 minutes

 2019
S K Mondal‟s
37. The annual demand of valves per year in a company is 10,000 units. The current order quantity
is 400 valves per order. The holding cost is Rs. 24 per valve per year and the ordering cost is
Rs. 400 per order. If the current order quantity is changed to Economic order quantity, then the
saving in the total cost of inventory per year will be Rs____ (round of to two decimal places).
Key: (943.60)
Sol: D  1000 units
Q  400 Values / order 2DCo 2  10000  400
EOQ   Q  EOQ  577.35
Cn 24
C n  24 rs value / year
C0  400 Rs order

TIC  Q   2DCo Cn  2 10000  400  24  13856

D Q 10000 400
TIC  Q   C0  Cn   400  24  10000  4800  14800
Q 2 400 2
saving  14800  13856.41  Rs.943.60
 2019
S K Mondal‟s
39. The activities of a project, their duration and the precedence relationship are given in the table.
For example, in a precedence relationship “X <Y, Z” means that X is predecessor of activities
Y and Z. The time to complete the activities along the critical path is _______weeks,

Activity Duration (weeks) Precedence Relationship

A 5 A<B, C,D
B 7 B<E,F,G
C 10 C<I
D 6 D <G
E 3 E<H
F 9 F<I
G 7 G<I
H 4 H<I
I 2 ……

(A) 21 (B) 23 (C) 17 (D) 25

Key: (B)
Sol: C 0

E  3 H  4
A  5 B7 I  2

D 6 F 9

G 7

ACI  5  10  2  17days
ABEHI  5  7  3  4  2  21days
ABFI  5  7  9  2  23 days
ABGI  5  7  7  2  21days
Time required = 23 days
 2018
S K Mondal‟s
6. The time series forecasting method that gives equal weightage to each of the m most recent
observations is
(A) Moving average method (B) Exponential smoothing with linear trend
(C) Triple Exponential smoothing (D) Kalman Filter
Key (A)
1
Sol ∵ in Moving Average Method So, weightage of all past data is
n
Dn  Dn 1  Dn  2  ...
Fn 1  i.e., equal weightage provided to all past data.
n

34. The minimum value of 3x + 5y such that:

3x + 5y  15
4x + 9y  8
13x + 2y  2
x  0, y  0
is _______.
Key: (0)
Sol: ∵ All main constraints are of  type and

Non-negativity constraints are of  type.

So, feasible region contain origin (0, 0) as corner point.

So, at origin (0, 0)
zmin  3 0  5 0  0
 2018
S K Mondal‟s
41. Processing times (including setup times) and due dates for six jobs waiting to be processed at a
work centre are given in the table. The average tardiness (in days) using shortest processing time
rule is ___ (correct to two decimal places).

Job Processing time (days) Due date (days)

A 3 8

B 7 16

C 4 4

D 9 18

E 5 17

F 13 19

,Key: (6.33)
Sol: By SPT rule

Job Sequence P.T Machining D.D Tardiness

In Out

A 3 0 3 8 0

C 4 3 7 4 3

E 5 7 12 17 0

B 7 12 19 16 3

D 9 19 28 18 10

F 13 28 41 19 22

Total Tardiness = 38
38
Average Tardiness   6.33days
6
 2018
S K Mondal‟s
7. The arrival of customers over fixed time intervals in a bank follow a Poisson distribution with an
average of 30 customers / hour. The probability that the time between successive customer arrival
is between 1 and 3 minutes is _____ (Correct to two decimal places).
Key: (0.3834)
Exp:   30 / hr
P 1  1  e0.51  0.3934
  0.5 / min So, P 1  T  3  0.7768  0.3934  0.3834
 P t   1  e t P  3  1  e0.53  0.7768

23. A local tyre distributor expects to sell approximately 9600 steel belted radial tyres next year.
Annual carrying cost is Rs. 16 per tyre and ordering cost is Rs. 75. The economic order quantity
of the tyres is
(A) 64 (B) 212 (C) 300 (D) 1200
Key: (C)
Exp: 2DF 2  9600  75
EOQ    300 units
C 16

35. The arc lengths of a directed graph of a project are as shown in the figure. The shortest path length
from node 1 to node 6 is ____________
4
2 4
2
2
2
1 1 1 6

4 4
3
Key: (7) 3 5
Exp: Shortest Path is
(1) – (2) – (5) – (4) – (6)
& length of shortest path = 2+2+1+2 = 7

36. The problem of maximizing z=x1-x2 subject to constraints x1  x 2  10, x1  0, x 2  0 and

x 2  5 has
(A) no solution (B) one solution
(C) two solutions (D) more than two solutions
Key: (B)
Exp: slope of objective function is not equal to slope of any one constraint so, unique optional
solution
 2017
S K Mondal‟s
34. Following data refers to the jobs (P, Q, R, S) which have arrived at a machine for scheduling.
The shortest possible average flow time is ___________ days.

Job Processing Time (days)

P 15
Q 9
R 22
S 12

Key: 31 (not matching with IIT key)

Exp: For shortest avg. flow time SPT rule is used
Job Sequence Processing Time In Out Flow Time
Q 9 0 9 9
S 12 9 21 21
P 15 21 36 36
R 22 36 58 58
9  21  36  58
Min Avg. Flow time   31 days
4

35. Two models, P and Q, of a product earn profits of Rs. 100 and Rs. 80 per piece, respectively.
Production times for P and Q are 5 hours and 3 hours, respectively, while the total production
time available is 150 hours. For a total batch size of 40, to maximize profit, the number of
units of P to be produced is ____________.
Key: 15 to 15
Exp: Let x1  No. of units of P
x 2  No. of units of Q
x2
max. z  100 x1  80x 2  0,50 
5x1  3x 2  150
x1  x 2  40  0, 40  15, 25 
Z 0,40  Rs.3200
Z15,225  Rs.3500  max.profit  0,0 
x1
 30,0   40,0 
So, for maximum profit, No. of units of P produced is 15 units.
 2017
S K Mondal‟s
3. The standard deviation of linear dimensions P and Q are 3 m and 4 m, respectively. When
assembled, the standard deviation (in m ) of the resulting linear dimension (P+Q) is ________
Key: 5 to 5
Exp: Given that
Standard deviate of P is 3 m  Variance of P is 9 m
Standard deviation of Q is 4 m  Variance of Q is 16 m
Variance of P + Q = Var (P+Q) = Variance P + Variance Q
= 9 + 16= 25
 Standard deviation of P + Q = + Variance = + 25 = 5

12. For a single server with Poisson arrival and exponential service time, the arrival rate is 12 per
hour. Which one of the following service rates will provide a steady state finite queue length?
(A) 6 per hour (B) 10 per hour (C) 12 per hour (D) 24 per hour
Key: (D)
Exp:   12 / hour
For steady state finite queue length    So,   24 / hour

40. A product made in two factories p and Q, is transported to two destinations, R and S. The per
unit costs of transportation (in Rupees) from factories to destinations are as per the following
matrix:
Destination
R S
Factory
P 10 7
Q 3 4

Factory P produces 7 units and factory Q produces 9 units of the product. Each destination
requires 8 units. If the north-west corner method provides the total transportation cost as X (in
Rupees) and the optimized (the minimum) total transportation cost Y (in Rupees), then (X-Y),
in Rupees, is
(A) 0 (B) 15 (C) 35 (D) 105
Key: Answer is not matched with IIT Key
Exp:

Total minimum Cost, y = 3×8+4×1+7×7=Rs.77

So, x–y = Rs.28
 2017
S K Mondal‟s
53. A project starts with activity A and ends with activity F. The precedence relation and durations
of the activities are as per the following table:

Duration
Activity Immediate Predecessor
(days)
A - 4
B A 3
C A 7
D B 14
E C 4
F D,E 9
The minimum project completion time (in days) is ______
Key: 30 to 30
Exp: 3 D
B
3 14
1 A 2 5 F 6
4 4 9
C, 7 4 E
Minimum project completion Time = Length of longest path = 4+3+14+9=30 Days.
x2

  26 2 
54. Maximize Z = 5x1+3x2  0,5   , 
 3 3
Subject to

10,0  x1
x1+2x2  10,  0,0   8,0 
x1–x2  8,
  0, 8 
x1, x2  0.
In the starting Simplex tableau, x1 and x2 are non-basic variables and the value of Z is zero.
The value of Z in the next Simplex tableau is _________.
Key: 40 to 40
 26 2 
Exp: Zmax at  , 
 3 3
1 Table at  0,0   Z  0
st

2nd Table at 8,0   Z  40

 2016
S K Mondal‟s
54. The annual demand for an item is 10,000 units. The unit cost is Rs. 100 and inventory carrying charges
are 14.4% of the unit cost per annum. The cost of one procurement is Rs. 2000. The time between two
consecutive orders to meet the above demand is ______ month(s).
Key: 2
Exp: D= 10,000, Cu = Rs 100, Ch= 0.144×Cu, Co=Rs 2,000. Q*

2DC0 2  10,000  2000

Q*    1666.67 units
Ch 0.144  100

Q * 1666.67
We know T    0.1667 years = 2 months T
D 10,000

55. Maximize Z=15X1 + 20X2

subject to
12X1+ 4X2 ≥ 36
12X1 − 6X2 ≤ 24
X1, X2 ≥ 0
The above linear programming problem has
(A) infeasible solution (B) unbounded solution
(C) alternative optimum solutions (D) degenerate solution
Key: (B)
Exp: Max Z  15x1  20x 2
Subject to
12x1  4x 2  36
12x1  6x 2  24
x1 , x 2  0
Since, there is no limitation of boundary for the feasible region therefore, the LPP has unbounded
solution.
 2016
S K Mondal‟s
20. In a single-channel queuing model, the customer arrival rate is 12 per hour and the serving rate is 24 per
hour. The expected time that a customer is in queue is minutes.
Key: 2.5
 12
Exp:   12 hr ,   24 hr      0.5
 24
Let, expected time that a customer spend in queue is w q

  0.5  0.5
L   1 
Lq 0.5
wq   s   0.5  60   60  2.5mins
   12 12

54. A food processing company uses 25,000 kg of corn flour every year. The quantity-discount price of corn
flour is provided in the table below:

Quantity (kg) Unit price (Rs/kg)

1-749 70
750-1499 65
1500 and above 60

The order processing charges are Rs. 500/order. The handling plus carry-over charge on an annual basis
is 20% of the purchase price of the corn flour per kg. The optimal order quantity (in kg) is .
Key: 1500
Exp: D = 25000 kg, C0 = Rs 500/order, Ch = 20% of Cu

Qty (kg) Cu (Rs/kg) Ch (Rs/Kg/year)

1  Q1  750 70 0.2  70  14
750  Q2  1500 65 0.2  65  13
Q3  1500 60 0.2  60  12

This problem belongs to inventory model with two price break.

2DCo
Q 
Ch
 first checking for least unit price

2  25000  500
Q*3   1443.37
12
Now, 1443.37 < 1500 therefore, the company will not get the item at Rs 60/kg
Now, checking for second minimum unit price
 2016
S K Mondal‟s

2  25000  500
Q*2   1386.75
13
Since, 1386.75 lies between 750 and 1500
Therefore, we need to find

 
Total cost Q2  25000  65 
25000
1386.75
 500 
1386.75
2
13  Rs1643027.755

 D Q 
T.C  D  Cu  Q  C0  2  Ch 
 
25000 1500
Totalcost 1500   25000  60   500  12  Rs 1517333.33
1500 2
Since, T.C (1500) < T.C Q*2 0  Therefore, optimal order quantity is 1500.

55. A project consists of 14 activities, A to N. The duration of these activities (in days) are shown in brackets
on the network diagram. The latest finish time (in days) for node 10 is

Key: 14
Exp:
E5
E9
L  10
L  14
3 4
10
3 E  10
8 L  12
2 3
E2 6
L2 2 E 8
3
2 L  10 2 2
4 4 9 12
1 2 11
E0 E6 4 5 E  15 E  17 E  19
L0 L6 L  15 L  17 L  19
7
2 E  10 4
L  10

5 The latest finish time for node 10 is 14 days.

E4
L  11
 2016
S K Mondal‟s
25. In PERT chart, the activity time distribution is
(A) Normal (B) Binomial (C) Poisson (D) Beta
Key: (D)

54. The demand for a two-wheeler was 900 units and 1030 units in April 2015 and May
2015, respectively. The forecast for the month of April 2015 was 850 units. Considering a
smoothing constant of 0.6, the forecast for the month of June 2015 is
(A) 850 units (B) 927 units
(C) 965 units (D) 970 units
Key: (D)
Exp:
Month Demand Forecast    D t 1  1    Ft 1 
April 900 850
May 1030  0.6 900  0.4 850  880
June  0.6 1030  0.4 880  970
 FJune  970 units
55. A firm uses a turning center, a milling center and a grinding machine to produce two parts.
The table below provides the machining time required for each part and the maximum
machining time available on each machine. The profit per unit on parts I and II are Rs. 40 and
Rs. 100, respectively. The maximum profit per week of the firm is Rs. .

Machining time required for

the machine part (minutes) Maximum machining time
Type of machine
available per week (minutes)
I II
Turning Center 12 6 6000
Milling Center 4 10 4000
Grinding Machine 2 3 1800

Key: 40,000 x2

Exp: Linear program formulation is

max z  40x1  100x 2  0, 1000
Constraints are
12x1  6x 2  6000  0, 600
4x1  10x 2  4000
2x1  3x 2  1800  0, 400
375, 250
x1 , x 2  0
At  0,400  , z  40,000
x1
At  375, 250  ,z  40,000 500,0 900,0 1000,0
At  500,0  ,z  20,000 ∴ Maximum profit per week is Rs. 40,000.
 2015
S K Mondal‟s
35. For a canteen, the actual demand for disposable cups was 500 units in January and 600 units
in February. The forecast for the month of January was 400 units. The forecast for the month
of March considering smoothing coefficient as 0.75 is _______.
Answer: 560.75
Exp: Forecast for Feb  400    500  400   400  .25  100  475
Forecast for march  475    600  475  560.75

50. Following data refers to the activities of a project, where, node 1 refers to the start and node 5
refers to the end of the project

Activity Duration (days)

1-2 2
2-3 1
4-3 3
1-4 3
2-5 3
3-5 2
4-5 4

The critical path (CP) in the network is

(A) 1-2-3-5 (B) 1-4-3-5 (C) 1-2-3-4-5 (D) 1-4-5

Answer: (B)

Exp:
2 5
0 2 2 5
2 3 6 8
1 3
0 3 3 6

4 3 7

Critical path-1-4-3-5
Time taken = 8 days
 2015
S K Mondal‟s
9. During the development of a product an entirely new process plan is made based on design
logic, examination of geometry and tolerance information. This type of process planning is
known as
(A) Retrieval (B) Generative
(C) Variant (D) Group technology based
Answer: (D)

10. Annual demand of a product is 50000 units and the ordering cost is Rs. 7000 per order
considering the basic economic order quantity model, the economic order quantity is 10000
units. When the annual inventory cost is minimized, the annual inventory holding cost (in Rs.)
is _______
Answer: 35000
Exp: At optimum total inventory cost (TIC), annual inventory hold is cost is equal to annual
inventory ordering cost
50000
= Number of orders × ordering cost per order   7000  5  7000  35000
10000

11. Sales data of a product is given in the following table:

Month January February March April May

Number of unit 10 11 16 19 25
sold

Regarding forecast for the month of June, which one of the following statements is TRUE?
(A) Moving average will forecast a higher value compared to regression
(B) Higher the value of order N, the greater will be the forecast value by moving average.
(C) Exponential smoothing will forecast a higher value compared to regression.
(D) Regression will forecast a higher value compared to moving average
Answer: (B)
Exp: In case of increasing trend, regression will give increasing value than moving average.
 2015
S K Mondal‟s
31. A manufacturer has the following data regarding a product:
Fixed cost per month = Rs. 50000
Variable cost per unit = Rs.200
Selling price per unit = Rs.300
Production capacity = 1500 units per month
If the production is carried out at 80% of the rated capacity, that the monthly profit (in Rs.) is
________
Answer: 70000
Exp: Profit per month = 0.8 ×1500 × (300-200) – 50000 = 120000-50000 = 70000

54. A project consists of 7 activities. The network along with the time durations (in days) for
various activities is shown in the figure.

12 11 10
1 3 5 6

14
12
9

2 7 4

The minimum time (in days) for completion of the project is _____
Answer: 40
Exp: Time taken for 3 paths are as follows
Path 1 = 12+11+10
Path 2 = 14+12+10
Path 3 = 14+7+9+10
∴ Path3 is longest i.e. path 3 is critical path
∴ Project duration = 40 days

19. In the notation (a/b/c) : (d/e/f) for summarizing the characteristics of queueing situation,
the letters ‘b’ and ‘d’ stand respectively for
(A) service time distribution and queue discipline
(B) number of servers and size of calling source
(C) number of servers and queue discipline
(D) service time distribution and maximum number allowed in system
Answer: (A)
Exp: b: Service time distribution (usually represented by ‘m’)
D: Queuing discipline (usually represented by ‘GD’)
 2015
S K Mondal‟s
37. For the linear programming problem:

Maximize Z = 3X1 + 2X2

Subject to – 2X1 + 3X2 ≤ 9 X1 – 5X2 ≥ – 20 X1, X2 ≥ 0

The above problem has
(A) unbounded solution (C) alternative optimum solution
(B) infeasible solution (D) degenerate solution

Answer: (A)
Exp: Plotting the graph for the given constraints as shown in figure.
From figure we can see that LPP has unbounded solution.

x2

(0,4)

(20,0) x1 
(45,0)

41. The annual requirement of rivets at a ship manufacturing company is 2000 kg. The rivets
are supplied in units of 1 kg costing Rs. 25 each. If the costs Rs. 100 to place an order and
the annual cost of carrying one unit is 9% of its purchase cost, the cycle length of the
order (in days) will be_____
Answer: 76.94
2DC0 2  2000  100
Exp: EOQ    421.637
Ch 0.09  25

365 2000
length of cycle   76.948 days No. of orders 
No. of orders EOQ
 2014
S K Mondal‟s
18. The jobs arrive at a facility, for service, in a random manner. The probability distribution of number of
arrivals of jobs in a fixed time interval is
(A) Normal (B) Poisson (C) Erlang (D) Beta

Answer: (B)

19. In exponential smoothening method, which one of the following is true?

(A) 0    1 and high value of α is used for stable demand

(B) 0    1 and high value of α is used for unstable demand

(C)   1 and high value of α is used for stable demand

(D)   0 and high value of α is used for unstable demand

Answer: (B)

50. Jobs arrive at a facility at an average rate of 5 in an 8 hour shift. The arrival of the jobs follows Poisson
distribution. The average service time of a job on the facility is 40 minutes. The service time follows
exponential distribution. Idle time (in hours) at the facility per shift will be

5 14 7 10
 A  B  C  D
7 3 5 3

Answer: (B)
Arrival rate ^lh = 5 jobs in 8 hours
Average service time = 40 min /job
So total service time = 40 # 5 (because 5 jobs are there) = 200 min
= 200 = 10 hours
60 3
So Idle time per shift at the facility
= 8 - 10
3
= 24 - 10 = 14 hours
3 3
 2014
S K Mondal‟s
If there are m sources and n destinations in a transportation matrix, the total
number of basic variables in a basic feasible solution is
(A) m + n (B) m + n + 1
(C) m + n - 1 (D) m

A component can be produced by any of the four processes I, II, III and IV. The
fixed cost and the variable cost for each of the processes are listed below. The
most economical process for producing a batch of 100 pieces is
Process Fixed cost (in Rs.) Variable cost per piece (in Rs.)
I 20 3
II 50 1
III 40 2
IV 10 4
(A) I (B) II
(C) III (D) IV
 2014
S K Mondal‟s
A project has four activities P, Q, R and S as shown below.
Activity Normal duration (days) Predecessor Cost slope (Rs./day)
P 3 - 500
Q 7 P 100
R 4 P 400
S 5 R 200
The normal cost of the project is Rs. 10,000/- and the overhead cost is Rs. 200/-
per day. If the project duration has to be crashed down to 9 days, the total cost
(in Rupees) of the project is ______

Path P - Q = 10 days
P - R - S = 3 + 4 + 5 = 12 days
So P - R - S is critical path

Now we will crash the activity ‘S ’ by 2 days.

So now P - R = 10 days
P - R - S = 10 days
both are critical paths
So Total cost of project will be = Normal cost + overhead cost + crashing

cost = 10000 + 200 # ^10 daysh + 200 # 2

= 10000 + 2000 + 400
= 12400 Rs

Consider the following data with reference to elementary deterministic economic

order quantity model
Annual demand of an item 100000
Unit price of the item (in Rs.) 10
Inventory carrying cost per unit per year (in Rs.) 1.5
Unit order cost (in Rs.) 30
The total number of economic orders per year to meet the annual demand is
______

Economic Order Quantity

EOQ = 2C 0 D = 2 # 30 # 100000 = 2000
CC 1. 5

no of orders = D = 100000 = 50
EOQ 2000
 2014
S K Mondal‟s
19. The actual sales of a product in different months of a particular year are given below:

September October November December January February

180 280 250 190 240 ?

The forecast of the sales, using the 4-month moving average method, for the month of February is
_______.
Answer: (239 to 241)

Moving average forcasting method

(Forcasted value for next month) = Previous months actual sales addition
No. of months
For February forcasting = 250 + 250 + 190 + 240
4
Ffeb = 240

21. A minimal spanning tree in network flow models involves

(A) All the nodes with cycle/loop allowed
(B) All the nodes with cycle/loop not allowed
(C) Shortest path between start and end nodes
(D) All the nodes with directed arcs

Answer: (B)

To make network flow diagram in critical path method minimal spanning tree
properties are followed. This does not allow any loop or cycle at any node.
For example suppose a loop with activity A, B and C

Now activity ‘B ’ will be done after activity ‘A’ and activity ‘A’ will be done only
after activity ‘C ’. But activity ‘C ’ can not be completed before begining ‘C ’ so
network will fail if minimal spanning tree model is not followed.
 2014
S K Mondal‟s

50. Consider the given project network, where numbers along various activities represent the normal time.
The free float on activity 4-6 and the project duration, respectively, are

2
2 5
3
3
2 5
1 3 5 6 7

4
2
4

(A) 2, 13 (B) 0, 13 (C) –2, 13 (D) 2, 12

Answer: (A)

There are three possible paths can be

(1) – (2) – (5) – (6) – (7) ___ path (A) Duration of path (A) = 3 + 2 + 3 + 5 = 13*
(1) – (3) – (6) – (7) ___ path (B) Duration of path (B) = 2 + 5 + 5 = 12
(1) – (4) – (6) – (7) ___ path (C) Duration of path (C) = 2 + 4 + 5 = 11
Path (A) takes maximum time that is critical path so project duration is 13 days.
For free float on activity (4) – (6)
Free float = Earliest start time of event (6) - Earliest start time of event (4)
- project duration
= 8-2-4 = 2
Free float (for 4 – 6 activity) = 2

51. A manufacturer can produce 12000 bearings per day. The manufacturer received an order of 8000
bearings per day from a customer. The cost of holding a bearing in stock is Rs.0.20 per month. Setup cost
per production run is Rs.500. Assuming 300 working days in a year, the frequency of production run
should be
(A) 4.5 days (B) 4.5 months (C) 6.8 days (D) 6.8 months

Answer: (C)
Economic order quantity for this model
EOQ = 2DCo P
Ch P-d
 2014
S K Mondal‟s

2 ^8000 # 365h # 500 12000

EOQ =
^0.2 # 12h ^12000 - 8000h
EOQ = 60415.22987 units
No. of set-up times for production = D = 8000 # 365
EOQ 60415.22987
= 48.3321
working days = 300 = 6.2070 days
Frequency of production run = 48.3321
no. of set-ups

39. Consider an objective function Z  x1,x 2   3x1  9x 2 and the constraints

x1  x 2  8,
x1  2x 2  4,
x1 , x 2  0,

The maximum value of the objective function is ____________.

Answer: (17 to 19)

^z h^4, 0h = 3 # 4 + 9 # 0 = 12
^z h^0, 2h = 3 # 0 + 9 # 2 = 18
^z hmax = 18
 2014
S K Mondal‟s

18. The total number of decision variables in the objective function of an assignment problem of size n × n (n
jobs and n machines) is
(A) n2 (B) 2n (C) 2 n- 1 (D) n

Answer: (A)
A decision variable is an unknown in an optimization problem. It has a domain,
which is a compact representation of the set of all possible values for the variable.
So for assignment problem of size n # n total no. of decision variable are total
possibilities to assign value in assignment matrix.

Total no. of decision variables = n # n = n2 .

19. Demand during lead time with associated probabilities is shown below:

Demand 50 70 75 80 85

Probability 0.15 0.14 0.21 0.20 0.30

Expected demand during lead time is _______.

Answer: (74 to 75)
Expected demand during lead time = SDP ^x h
= 50 # 0.15 + 70 # 0.14 + 75 # 0.21 + 80 # 0.2 + 85 # 0.30 = 74.55

51. At a work station, 5 jobs arrive every minute. The mean time spent on each job in the work station is 1/8
minute. The mean steady state number of jobs in the system is __________.

Answer: (1.62 to 1.70)

Ls = d
1-d
where d = busyness = l = 5
m 8
5/8
Ls =
1 - 5/8
5/8 5
Ls = =
3/8 3
Ls = 1.6666 jobs
 2014
S K Mondal‟s
50. The precedence relations and duration (in days) of activities of a project network are given in the table.
The total float (in days) of activities e and f , respectively, are

(A) 0 and 4 (B) 1 and 4 Activity Predecessors Duration (days)

(C) 2 and 3 (D) 3 and 1 a - 2
Answer: (B) b - 4
c a 2
d b 3
e c 2
f c 4
g d,e 5

Project network based on activities & their predecessors given in problem table

Activity duration Est EFT LST LFT Total Float

a 2 0 2 1 3 1
b 4 0 4 0 4 0
c 2 2 4 3 5 1
d 3 4 7 4 7 0
e 2 4 6 5 7 1
f 4 4 8 8 12 4
g 5 7 12 7 12 0
Total Float = LFT – EFT = LST - EST
where
EST = Ealiast short time LST = Latest start time
EFT = Ealiast Finish time LFT = Latest Finish time
 2013
S K Mondal‟s
13. Customers arrive at a ticket counter at a rate of 50 per hour and tickets are
issued in the order of their arrival. The average time taken for issuing a ticket is
1min. Assuming that customer arrivals form a Poisson process and service times
are exponentially distributed, the average waiting time in queue in minutes is:
(A) 3 (B) 4 (C) 5 (D) 6
Answer: (C)
Explanation:
λ
λ = 50 / hr µ = 60 / hr W.T = = 0.083hr = 5 min
µ (µ − λ )

14. In simple exponential smoothing forecasting, to give higher weightage to recent

demand information, the smoothing constant must be close to
(A) -1 (B) zero (C) 0.5 (D) 1
Answer: (D)
Explanations:- Value of α close to one have less of a smoothing effect and give greater
weight to recent changes in the data.

36. A linear programming problem is shown below:

Maximize 3x + 7y

3x + 7y ≤ 10
Subject to 4x + 6y ≤ 8
x, y ≥ 0

It has

(A) an unbounded objective function (B) exactly one optimal solution

(C) exactly two optimal solutions (D) infinitely many optimal solutions
y
Answer: (B)
Explanations:- (0,1.42)

(0,1.33)
3x + 7y ≤ 0
4x + 6y ≤ 8

x
(2,0) (3.33,0)