Date 23-Oct-23 Submission date: 23-Nov-2023

ASSIGNMENT SET-I FOR EE4125 & ME4105 INDUSTRIAL ENGINEERING COURSE

Question-1 (a) : (Cell-location – Quadratic Assignment problem)

A manufacturing system is laid out to facilitate Cellular-
Manufacturing system. In the cellular manufacturing layout there C2
C1
are 4-Cells which are to be located at the 4-Sites within a plant.
The cells are denoted as C1, C2, C3 and C4 while the sites are
denoted as Site-1, Site-2, Site-3 and Site-4. The problem is Site-1 Site-2
shown schematically in the Figure-1.

The distances between sites 𝒌 & 𝒍 is denoted by 𝒅𝒌𝒍 and the

amount of weight of the material movement from the cells 𝑪𝒊 to 𝑪𝒋
C3 C4
is denoted as 𝑾𝒊𝒋 . The distances between the sites are given in
the Distance Matrix shown below. And the weights of material-
movements between the cells are given in the Weight Matrix Site-3 Site-4
given below. The binary variable 𝑿𝒋𝒍 is used to denote the
Figure-1: Cell locations
location of Cell-𝑗 at Site-𝑙 and the objective function is a sum-
at different sites
product of weights, distances and the variable denoting the
location, given below:

𝑜𝑏𝑗𝑒𝑐𝑡𝑖𝑣𝑒 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛 = ∑ ∑ ∑ ∑ 𝑊𝑖𝑗 𝑑𝑘𝑙 𝑋𝑖𝑘 𝑋𝑗𝑙

𝑖 𝑗 𝑘 𝑙

Four strategies of locations are given below. Calculate which of these four strategies is
going to result in a lesser value of the objective function.
The Distance Matrix and the Load Matrix are given below:

Load Matrix Wij

Distance Matrix
1 2 3 4
1 2 3 4
1 0 3 5 6
1 0 4 6 3
2 3 0 2 5
2 4 0 5 4
3 5 2 0 3
3 6 5 0 3
4 6 5 3 0
4 3 4 3 0
Four strategies are given below, calculate which strategy is going to result in a lesser
value of the objective function. The Strategy-2 indicates that the cell C1, C3, C2 & C4
are located at sites 1,2,3 &4 and similarly it is for Strategy-1,3 & 4 indicated below:

Strategy-1: 1 2 3 4
Strategy-2: 1 3 2 4
Strategy-3 4 1 3 2
Strategy-4 4 1 2 3

{Note: Since the matrices are symmetric calculate half of the sum-product and
double it}

Question-2 : (Flexible Machine System – Part Selection Problem)

Consider a Flexible Machine System where there are 11-parts available for
machining. There is a profit associated with each part and each part requires some
specified amount of time for its processing. The profit earned by machining these
parts and their process times are given below. The problem is to choose the parts
such that the profit is maximized while maintaining the constraint of time of 2000 sec.
Part-1 Part-2 Part-3 Part-4 Part-5 Part-6 Part-7 Part-8 Part-9 Part-10 Part-11
Profit, Rs. 900 600 500 400 300 200 100 50 45 40 35
Process time, sec. 800 500 450 400 300 200 80 60 50 45 40

Hence calculate which of these-11 parts are selected for machining such that the
profit is maximized and the time constraint of 2000 seconds is met. State the
maximum value of profit and the total time required for processing the jobs.

{Note: For solution of the problem, you may use a solver. Use the Binary Knapsack
method to find a solution to the problem}

Question-3: (Flexible Machine System – Machine Selection Problem)

A Flexible Manufacturing System consists of 2-Automatic-Machine-
Tools used for the manufacture of 7-Jobs. Both the machines have a
tool-slot holder / pallet-holder, of a circular form as shown in the
figure. There is a limitation of the total number of tools which may be
fixed on the tool-slot holder. A table given below mentions the
processing time of a job on a particular type of machine. There are 7-
Jobs to be processed on the 2-Machines. The number of tools
required for a particular job is shown in the row 𝑆𝑖, which indicates
the number of tools required for each of the Jobs J1 to J7 on any of
the machines. It may be noted that the tool used by a job is not

2
common to other jobs, in other words the tool slot variable 𝑆𝑖 represents a Disjoint-
Set.
Calculate an optimum schedule for this machine-loading problem, given the
processing times of the two machines. The Jobs are to be assigned to a particular
machine such that the Makespan is minimized.

Processing Times and the Tool-requirement for the Seven-Jobs

M\J J1 J2 J3 J4 J5 J6 J7 Ti
M1 2 4 6 8 6 7 9 10
M2 1 5 7 8 8 8 7 10
Si 2 3 3 3 2 2 5
Statement of optimization:

𝑀𝑖𝑛𝑖𝑚𝑖𝑧𝑒: 𝑢; 𝑤ℎ𝑒𝑟𝑒 𝑢 = 𝑢1 + 𝑢2
The real valued functions 𝑢1 𝑎𝑛𝑑 𝑢2 are the processing times on the Machine M1 and
M2 respectively and are stated as:
𝑢1 = 𝑝11 𝑋11 + 𝑝21 𝑋21 + ⋯ + 𝑝71 𝑋71
𝑢2 = 𝑝12 𝑋12 + 𝑝22 𝑋22 + ⋯ + 𝑝72 𝑋72

Here 𝑋𝑖𝑗 = 0,1 are the decision variables indicating the particular machine loading.

Here, 𝑢 stands for the machine loading in terms of the Makespan, 𝑝𝑖1 and 𝑝𝑖2
indicates the processing times on machine 1&2 respectively, and 𝑋𝑖1 and 𝑋𝑖2 are the
binary decision variables of loading the machine 1&2 with the part-𝑖. It may be noted
that 𝑋𝑖1 &𝑋𝑖2 are mutually exclusive, hence if machine-1 is to be loaded with the part-𝑖
the machine-2 is not to be loaded with the same part.
State the Minimum value of Makespan required.

Q4. (Manufacturing Systems – Just in Time manufacturing & Kanban)

A Just-in-Time manufacturing system was incorporated
in a production unit to reduce the inventory to a bare
minimum. The Just-in-Time system adopts a Kanban
container system to streamline the inputs received
from a supplier and coordinate it with the Work-in-
Process. In order to implement the Kanban system,
the model used is specified below:
(𝑓. 𝐷 + 𝑠)
𝑘=
𝑛
Where,
k: Number of kanban; [number]

3
 D: Lead time demand of items; [number]
f: Some fraction of the demand to meet the Work-in-Process; [number]
s: safety stock; [numbers]
n: kanban size or the number of quantities ordered in a container;
[number]
The demand in the present case is based on the number of output
required by customers, as it is a “pull” type system. The faction 𝑓 is the
portion of the supplied number of raw material which are expected to be
the Work-in-process. The safety stock is denoted by 𝑠 which needs to be
calculated to meet the uncertainties in the lead time demand. The safety
stock is calculated by estimating the probability of meeting the demand,
which is given as:
𝑄 𝐶𝑐 𝐶𝑐 × 𝑛
𝑝𝑚𝑒𝑒𝑡𝑖𝑛𝑔−𝑑𝑒𝑚𝑎𝑛𝑑 = 1 − =1−
𝐷 𝐶𝑠 𝐶𝑠 × 𝜇𝐿𝑇𝐷
Where:
𝐶𝑐 : carrying cost for one unit/day; [Rs/unit/day]
𝑛: number of units to be carried, generally it is the number of items in
a kanban-container;
𝐶𝑠 : shortage cost for one unit per day; [Rs/unit/day]
𝜇𝐿𝑇𝐷 : mean value or the expected value of the lead-time-demand
generally it is the number of units required per day; [units/day]

After calculating the probability of meeting the demand calculate the

value of z-score from table, assuming that the probability distribution is
normal. The standard deviation of the lead-time-demand is, 𝜎. Hence the
number of kanban is calculated as:
𝜇𝐿𝑇𝐷 + 𝑧. 𝜎
𝑘=
𝑛
Here, k is the number of kanban which is required.
For the Data Given below calculate the following:
Data Given:
𝑓 = 20% 𝑜𝑓 𝑑𝑒𝑚𝑎𝑛𝑑; 𝐷𝑒𝑚𝑎𝑛𝑑, 𝐷 = 160 [𝑢𝑛𝑖𝑡𝑠 𝑝𝑒𝑟 𝑑𝑎𝑦];

4
 𝑛 = 10 [𝑢𝑛𝑖𝑡𝑠 𝑝𝑒𝑟 𝑐𝑜𝑛𝑡𝑎𝑖𝑛𝑒𝑟]; 𝐶𝑎𝑟𝑟𝑦𝑖𝑛𝑔 𝑐𝑜𝑠𝑡, 𝐶𝑐 = 4 [𝑅𝑠. 𝑝𝑒𝑟 𝑢𝑛𝑖𝑡 𝑝𝑒𝑟 𝑑𝑎𝑦];
𝑆ℎ𝑜𝑟𝑡𝑎𝑔𝑒 𝑐𝑜𝑠𝑡, 𝐶𝑠 = 15 [𝑅𝑠. 𝑝𝑒𝑟 𝑢𝑛𝑖𝑡 𝑝𝑒𝑟 𝑑𝑎𝑦];
𝑆𝑡𝑎𝑛𝑑𝑎𝑟𝑑 𝑑𝑒𝑣𝑖𝑎𝑡𝑖𝑜𝑛, 𝜎 = 4 [𝑛𝑢𝑚𝑏𝑒𝑟𝑠]

Calculate following:
1. Probability of meeting demand;
2. Calculate 𝑧 value assuming a Standard Normal Distribution;
3. Number of kanban, 𝑘.

Q5. (Production Theory – Optimum Labor and Capital required)

Q5a. (Production Theory – Minimization of cost)
A firm operates with a production function given below:

𝑄 = 5𝐾 0.6 𝐿0.4
The rate at which the firm pays the labor, 80 [Rs.per hour], and the rate of interest
for the capital investment is 𝑟 = 10 [%]. The firm wants to know the cheapest way
for producing 100 units of output. Also check whether the stationary condition of
output thus obtained in a Minima or a Maxima, also calculate the total cost of
production.

Q5b. (Production Theory – Maximization of production for a budget constraint)

A firm operates with a production function given below:

𝑄 = 10𝐾 0.4 𝐿0.6

The rate at which the firm pays the labor, 100 [Rs.per hour], and the rate of
interest for the capital investment is 𝑟 = 15 [%]. The firm wants to implement a
budget constraint of 10,000 Rs. for the production output. Make use of the
Lagrange Multiplier method for calculating the stationary condition. Also check
whether the stationary condition of output thus obtained in a Minima or a Maxima,
also calculate the total cost of production.

𝑇𝐶 = 15𝐾 + 100𝐿

Q5c. (Production Theory – Maximization of production for a budget constraint)

A firm operates with a production function given below:

5
 𝑄 = 24𝐾 0.6 𝐿0.4
The rate at which the firm pays the labor, 80 [Rs.per hour], and the rate of interest
for the capital investment is 𝑟 = 18 [%]. What is the maximum output that the firm
can produce for a given budget constraint of 50,000 Rs. Make use of the
Lagrange Multiplier method for calculating the maximum value of production
output corresponding to the stationary condition. Also check whether the
stationary condition of output thus obtained in a Minima or a Maxima, also
calculate the total cost of production.

𝑇𝐶 = 18𝐾 + 80𝐿

Q6. (Production Theory – Maximization of profit)

Oligopoly case:
Q6a. (Production Theory – Maximization of profit in oligopoly case, Bertrand
price competition model)
Consider a case of oligopoly where there are two competitors, namely Firm-1 and
Firm-2, competing in a market to sell their products in a competitive manner. The
production output depends on the market price and the output, 𝑦1 , of Firm-1 is
given below:
𝑃𝑟𝑜𝑑𝑢𝑐𝑡𝑖𝑜𝑛 𝑜𝑢𝑡𝑝𝑢𝑡: 𝑦1 = 50 − 4𝑝1
Where 𝑦1 is the output of Firm-1 and 𝑝1 is the price offered by Firm-1.
Firm-1 earns a revenue given by the product of price and output as given below:
𝑅𝑒𝑣𝑒𝑛𝑢𝑒 𝑒𝑎𝑟𝑛𝑒𝑑: 𝑅1 (𝑝1 ) = 𝑝1 𝑦1
The Firm-1 spends an amount to manufacture the items, which results from the
product of manufacturing cost and the number of items produced. Hence, cost
model of Firm-1 is given below:
𝐶𝑜𝑠𝑡: 𝐶1 (𝑝1 ) = 3𝑦1
The profit earned by the Firm-1 results from the difference between the revenue
and the cost and it is given below:
𝑃𝑟𝑜𝑓𝑖𝑡, 𝜋 = 𝑅1 (𝑝1 ) − 𝐶1 (𝑝1 )
The price offered by Firm-2 is Rs.10. Assume that Firm-1 offers a price less than
the price offered by Firm-2, hence, 𝑝1 < 𝑝2 . Hence, calculate using the Bertrand
price competition model the following:
1. What should be the price offered by Firm-1 such that the profit earned by
them is a maximum, 𝑝1𝑚𝑎𝑥−𝑝𝑟𝑜𝑓𝑖𝑡 .
2. What is the price at which Firm-1 earns the maximum revenue, 𝑝1𝑚𝑎𝑥−𝑟𝑒𝑣. ;

6
 3. What is the value of maximum profit at 𝑝1𝑚𝑎𝑥−𝑝𝑟𝑜𝑓𝑖𝑡 .
4. What is the value of maximum revenue at 𝑝1𝑚𝑎𝑥−𝑟𝑒𝑣.

Perfect-Competition case:
Q6b. (Production Theory – Maximization of profit in Perfect Competition
case)
Consider a case of Perfect Competition where the price of a commodity is decided
by the market and it may be considered as fixed by the market. Given the
production function f and the rate at which the labor is hired and the interest rate
calculate the amount of labor and the capital to be engaged such that the profit is
maximized. The profit function is given below:

𝜋(𝑥1 , 𝑥2 ) = 𝑅𝑒𝑣𝑒𝑛𝑢𝑒 − 𝐶𝑜𝑠𝑡 = 𝑃 𝑓(𝑥1 , 𝑥2 ) − (𝑤1 𝑥1 + 𝑤2 𝑥2 )

The production function is given by:
𝜇
𝜌 𝜌
𝑄 = 𝑓(𝑥1 , 𝑥2 ) = [𝛼𝑥1 + (1 − 𝛼)𝑥2 ]𝜌
Where 0 ≠ 𝜌 ≤ 1; 𝑎𝑛𝑑 𝛼 𝜖 (0,1) and 𝜇 is a constant. The rate at which the
labor is hired is given as, 𝑤1 and the rate of interest is given as 𝑤2 .
The per unit price is P=10,000; Rs.

The per unit cost of labor, 𝑤1 = 50 [Rs/hr];

The interest rate on capital 𝑤2 = 20 [%];

The parameters of Cobb-Douglas function are:
3 1 1
𝑇ℎ𝑒 𝑐𝑜𝑏𝑏 − 𝑑𝑜𝑢𝑔𝑙𝑎𝑠 𝑝𝑎𝑟𝑎𝑚𝑒𝑡𝑒𝑟𝑠 𝑎𝑟𝑒, 𝛼= ; 𝜌= ; 𝜇= ;
5 2 4

Hence calculate the following:

1. The optimum value of the labor hired, 𝑥1 ∗ ;

2. The optimum value of the capital borrowed, 𝑥2 ∗ ;
3. The maximum profit earned, 𝜋(𝑥1 ∗ , 𝑥2 ∗ );
4. The output at the maximum value of profit, 𝑄.

Q7. (Production Theory – Pareto Optima Problem)

Consider here the case of sharing of endowments between two friends Salma and
Dev. In this problem assume that Salma has endowments of 70-units of apples and

7
140-units of oranges, while Dev has 210-units of apples and 140-units of oranges
respectively. The utility functions of Salma and Dev given below:

𝑢1 = 𝑥1 𝑦1 ; 𝑢𝑡𝑖𝑙𝑖𝑡𝑦 𝑜𝑓 𝑆𝑎𝑙𝑚𝑎
𝑢2 = 𝑥2 𝑦22 ; 𝑢𝑡𝑖𝑙𝑖𝑡𝑦 𝑜𝑓 𝐷𝑒𝑣
Both Salma and Dev exchange their endowments such that they are more happy
and more satisfied, however, they are constrained to be within their incomes. Also
assume that the prices of goods are same for both. Hence calculate the following:

1. The initial endowments for both 𝑥𝑏𝑎𝑟1, 𝑦𝑏𝑎𝑟1, 𝑥𝑏𝑎𝑟2 and 𝑦𝑏𝑎𝑟2;
𝑝𝑦
2. Hence calculate the ratio of prices 𝑘 = (𝑝 );
𝑥
3. Form the binding vector, representing the constraint, namely, 𝑏𝑣𝑒𝑐 .
4. Form the A-matrix binding condition and the ratio of prices such that:
𝐴𝑚𝑎𝑡 𝑥𝑣𝑒𝑐 = 𝑏𝑣𝑒𝑐
5. Solve the matrix equation for 𝑥𝑣𝑒𝑐 consisting of the variables:
𝑥1
𝑥2
𝑥𝑣𝑒𝑐 = [𝑦 ]
1
𝑦2
6. Hence state the values of the following: 𝑥1 , 𝑥2 , 𝑦1 , and 𝑦2 .
7. Calculate the values of utilities: 𝑢1 and 𝑢2
8. Also calculate the marginal rate of substitution for good-x and good-y for both
Salma and Dev, hence check if the condition given below is satisfied:
𝜕𝑢1 𝜕𝑢2
⁄𝜕𝑥 ⁄𝜕𝑥
1 2
=
𝜕𝑢1 𝜕𝑢2
⁄𝜕𝑦 ⁄𝜕𝑦
1 2

9. Hence state if the condition for Pareto Optimum is satisfied.

Data Given:
Initial x1: Salma’s good-x 70
Initial x2: Dev’s good-x 210
Initial y1: Salma’s good-y 140
Initial y2: Dev’s good-y 140
Initial u1: Salma’s utility 9,800
Initial u2: Dev’s utility 41,16,000

END OF ASSIGNMENT SET-I

8
 Table 1: Table of the Standard Normal Cumulative Distribution Function φ(z)

z 0 0.01 0.02 0.03 0.04 0.05 0.06 0.07 0.08 0.09

-3.4 0.0003 0.0003 0.0003 0.0003 0.0003 0.0003 0.0003 0.0003 0.0003 0.0002
-3.3 0.0005 0.0005 0.0005 0.0004 0.0004 0.0004 0.0004 0.0004 0.0004 0.0003
-3.2 0.0007 0.0007 0.0006 0.0006 0.0006 0.0006 0.0006 0.0005 0.0005 0.0005
-3.1 0.001 0.0009 0.0009 0.0009 0.0008 0.0008 0.0008 0.0008 0.0007 0.0007
-3 0.0013 0.0013 0.0013 0.0012 0.0012 0.0011 0.0011 0.0011 0.001 0.001
-2.9 0.0019 0.0018 0.0018 0.0017 0.0016 0.0016 0.0015 0.0015 0.0014 0.0014
-2.8 0.0026 0.0025 0.0024 0.0023 0.0023 0.0022 0.0021 0.0021 0.002 0.0019
-2.7 0.0035 0.0034 0.0033 0.0032 0.0031 0.003 0.0029 0.0028 0.0027 0.0026
-2.6 0.0047 0.0045 0.0044 0.0043 0.0041 0.004 0.0039 0.0038 0.0037 0.0036
-2.5 0.0062 0.006 0.0059 0.0057 0.0055 0.0054 0.0052 0.0051 0.0049 0.0048
-2.4 0.0082 0.008 0.0078 0.0075 0.0073 0.0071 0.0069 0.0068 0.0066 0.0064
-2.3 0.0107 0.0104 0.0102 0.0099 0.0096 0.0094 0.0091 0.0089 0.0087 0.0084
-2.2 0.0139 0.0136 0.0132 0.0129 0.0125 0.0122 0.0119 0.0116 0.0113 0.011
-2.1 0.0179 0.0174 0.017 0.0166 0.0162 0.0158 0.0154 0.015 0.0146 0.0143
-2 0.0228 0.0222 0.0217 0.0212 0.0207 0.0202 0.0197 0.0192 0.0188 0.0183
-1.9 0.0287 0.0281 0.0274 0.0268 0.0262 0.0256 0.025 0.0244 0.0239 0.0233
-1.8 0.0359 0.0351 0.0344 0.0336 0.0329 0.0322 0.0314 0.0307 0.0301 0.0294
-1.7 0.0446 0.0436 0.0427 0.0418 0.0409 0.0401 0.0392 0.0384 0.0375 0.0367
-1.6 0.0548 0.0537 0.0526 0.0516 0.0505 0.0495 0.0485 0.0475 0.0465 0.0455
-1.5 0.0668 0.0655 0.0643 0.063 0.0618 0.0606 0.0594 0.0582 0.0571 0.0559
-1.4 0.0808 0.0793 0.0778 0.0764 0.0749 0.0735 0.0721 0.0708 0.0694 0.0681
-1.3 0.0968 0.0951 0.0934 0.0918 0.0901 0.0885 0.0869 0.0853 0.0838 0.0823
-1.2 0.1151 0.1131 0.1112 0.1093 0.1075 0.1056 0.1038 0.102 0.1003 0.0985
-1.1 0.1357 0.1335 0.1314 0.1292 0.1271 0.1251 0.123 0.121 0.119 0.117
-1 0.1587 0.1562 0.1539 0.1515 0.1492 0.1469 0.1446 0.1423 0.1401 0.1379
-0.9 0.1841 0.1814 0.1788 0.1762 0.1736 0.1711 0.1685 0.166 0.1635 0.1611
-0.8 0.2119 0.209 0.2061 0.2033 0.2005 0.1977 0.1949 0.1922 0.1894 0.1867
-0.7 0.242 0.2389 0.2358 0.2327 0.2296 0.2266 0.2236 0.2206 0.2177 0.2148
-0.6 0.2743 0.2709 0.2676 0.2643 0.2611 0.2578 0.2546 0.2514 0.2483 0.2451
-0.5 0.3085 0.305 0.3015 0.2981 0.2946 0.2912 0.2877 0.2843 0.281 0.2776
-0.4 0.3446 0.3409 0.3372 0.3336 0.33 0.3264 0.3228 0.3192 0.3156 0.3121
-0.3 0.3821 0.3783 0.3745 0.3707 0.3669 0.3632 0.3594 0.3557 0.352 0.3483
-0.2 0.4207 0.4168 0.4129 0.409 0.4052 0.4013 0.3974 0.3936 0.3897 0.3859
-0.1 0.4602 0.4562 0.4522 0.4483 0.4443 0.4404 0.4364 0.4325 0.4286 0.4247
0 0.5 0.496 0.492 0.488 0.484 0.4801 0.4761 0.4721 0.4681 0.4641

9
z 0 0.01 0.02 0.03 0.04 0.05 0.06 0.07 0.08 0.09
0 0.5 0.504 0.508 0.512 0.516 0.5199 0.5239 0.5279 0.5319 0.5359
0.1 0.5398 0.5438 0.5478 0.5517 0.5557 0.5596 0.5636 0.5675 0.5714 0.5753
0.2 0.5793 0.5832 0.5871 0.591 0.5948 0.5987 0.6026 0.6064 0.6103 0.6141
0.3 0.6179 0.6217 0.6255 0.6293 0.6331 0.6368 0.6406 0.6443 0.648 0.6517
0.4 0.6554 0.6591 0.6628 0.6664 0.67 0.6736 0.6772 0.6808 0.6844 0.6879
0.5 0.6915 0.695 0.6985 0.7019 0.7054 0.7088 0.7123 0.7157 0.719 0.7224
0.6 0.7257 0.7291 0.7324 0.7357 0.7389 0.7422 0.7454 0.7486 0.7517 0.7549
0.7 0.758 0.7611 0.7642 0.7673 0.7704 0.7734 0.7764 0.7794 0.7823 0.7852
0.8 0.7881 0.791 0.7939 0.7967 0.7995 0.8023 0.8051 0.8078 0.8106 0.8133
0.9 0.8159 0.8186 0.8212 0.8238 0.8264 0.8289 0.8315 0.834 0.8365 0.8389
1 0.8413 0.8438 0.8461 0.8485 0.8508 0.8531 0.8554 0.8577 0.8599 0.8621
1.1 0.8643 0.8665 0.8686 0.8708 0.8729 0.8749 0.877 0.879 0.881 0.883
1.2 0.8849 0.8869 0.8888 0.8907 0.8925 0.8944 0.8962 0.898 0.8997 0.9015
1.3 0.9032 0.9049 0.9066 0.9082 0.9099 0.9115 0.9131 0.9147 0.9162 0.9177
1.4 0.9192 0.9207 0.9222 0.9236 0.9251 0.9265 0.9279 0.9292 0.9306 0.9319
1.5 0.9332 0.9345 0.9357 0.937 0.9382 0.9394 0.9406 0.9418 0.9429 0.9441
1.6 0.9452 0.9463 0.9474 0.9484 0.9495 0.9505 0.9515 0.9525 0.9535 0.9545
1.7 0.9554 0.9564 0.9573 0.9582 0.9591 0.9599 0.9608 0.9616 0.9625 0.9633
1.8 0.9641 0.9649 0.9656 0.9664 0.9671 0.9678 0.9686 0.9693 0.9699 0.9706
1.9 0.9713 0.9719 0.9726 0.9732 0.9738 0.9744 0.975 0.9756 0.9761 0.9767
2 0.9772 0.9778 0.9783 0.9788 0.9793 0.9798 0.9803 0.9808 0.9812 0.9817
2.1 0.9821 0.9826 0.983 0.9834 0.9838 0.9842 0.9846 0.985 0.9854 0.9857
2.2 0.9861 0.9864 0.9868 0.9871 0.9875 0.9878 0.9881 0.9884 0.9887 0.989
2.3 0.9893 0.9896 0.9898 0.9901 0.9904 0.9906 0.9909 0.9911 0.9913 0.9916
2.4 0.9918 0.992 0.9922 0.9925 0.9927 0.9929 0.9931 0.9932 0.9934 0.9936
2.5 0.9938 0.994 0.9941 0.9943 0.9945 0.9946 0.9948 0.9949 0.9951 0.9952
2.6 0.9953 0.9955 0.9956 0.9957 0.9959 0.996 0.9961 0.9962 0.9963 0.9964
2.7 0.9965 0.9966 0.9967 0.9968 0.9969 0.997 0.9971 0.9972 0.9973 0.9974
2.8 0.9974 0.9975 0.9976 0.9977 0.9977 0.9978 0.9979 0.9979 0.998 0.9981
2.9 0.9981 0.9982 0.9982 0.9983 0.9984 0.9984 0.9985 0.9985 0.9986 0.9986
3 0.9987 0.9987 0.9987 0.9988 0.9988 0.9989 0.9989 0.9989 0.999 0.999
3.1 0.999 0.9991 0.9991 0.9991 0.9992 0.9992 0.9992 0.9992 0.9993 0.9993
3.2 0.9993 0.9993 0.9994 0.9994 0.9994 0.9994 0.9994 0.9995 0.9995 0.9995
3.3 0.9995 0.9995 0.9995 0.9996 0.9996 0.9996 0.9996 0.9996 0.9996 0.9997
3.4 0.9997 0.9997 0.9997 0.9997 0.9997 0.9997 0.9997 0.9997 0.9997 0.9998

10