Course Name: Quantitative Techniques

Semester : III ( 2020) Course Code: 18JBS304

Assignment - 1

1. A Company sells two different products A and B, making a profit of Rs.40 and Rs.30 per
unit, respectively. They are both produced with the help of a common production process
and are sold in two different markets. The production process has a total capacity of
30,000 man-hours. It takes three hours to produce a unit of A and one hour to produce a
unit of B. The market has been surveyed and company officials feel that the maximum
number of units of A that can be sold is 8,000 units and that of B is 12,000 units. Subject
to these limitations, products can be sold in any combinations. Formulate this problem as
an LPP model to maximize profit and solve graphically.

2. A firm manufactures two types A and B and sells them at a profit of Rs. 2 on type A and
B Rs. 3 on type B. Each product is processed o two machines M1 and M2. Type A
requires 1 minute of processing time on M1 and 2 minutes on M2. Type B requires 1
minute on M1 and 1 minute on M2. Machine M1 is available for nor more than 6 hours
40 minutes while machine M2 is available for 10 hours during any working day.
Formulate the problem as a LPP so as to maximize the profit and solve graphically.
3. A company manufactures 2 types of printed circuits. The requirements of transistors,
resistors and capacitors for each type of printed circuits along with other data are given
below:

Circuit Stock available

A B
Transistor 18 12 180
Resistor 14 22 200
Capacitor 12 22 210
Profit Rs.12 Rs.18
How many circuits of each type should the company produce from the stock to earn
maximum profit and solve it graphically also?
4. Solve the following by graphical method:

Maximize z = 3x1 + 4x2

Subject to:
5x1 + 4x2 < 200
3x1 + 5x2 < 150
5x1 + 4x2 < 100

And x1, x2 > 0

5. Solve using graphical method.

Minimize z = 20x1 + 10x2

Subject to the constrains

x1 + x2  40

3x1 + x2 30

4x1 + 3x2 60

and x1, x2 0

6. Use the graphical method to solve the following LPP.

Maximize Z = 7X1+3X2
Subject to constraints
X1+2X2≥ 3
X1+X2≤ 4
0 ≤ X1≤ 5/2
0 ≤X2≤ 3/2
And
X1,X2≥ 0
7. A dairy firm has three plants located in a state. The daily milk production at each
plant is as follows:
Plant 1 : 6 million litres , Plant 2 : 1 million litres , and Plant 3: 10 million litres.

Each day, the firm must fulfill the needs of its four distribution centers. The
minimum requirement of each center is as follows :

Distribution center 1: 7 million litres, Distribution center2 :5 million litres,

Distribution center3 : 3 million litres, and Distribution center 4:2 million litres

Cost(in hundreds of rupees) of shipping one million litres from each plant to each
distribution center is given in the following table:

Distribution Center
D1 D2 D3 D4
Plant P1 2 3 11 7
P2 1 0 6 1
P3 5 8 15 9

Find the initial basic feasible solution for given problem by using

a) North-West corner rule

b) Least cost method

c) Vogel’s approximation method

If the objective is to minimize the total transportation cost.

8. Find the initial basic feasible solution for given problem by using

i) North-West corner rule

ii) Least cost method

iii) Vogel’s approximation method

X Y Z Supply
A 2 7 4 5
B 3 3 1 8
C 5 4 7 7
D 1 6 2 14
Requiremen 7 9 14
t
9. Find the initial basic feasible solution for given problem by using

i) North-West corner rule

ii) Least cost method

iii) Vogel’s approximation method

M1 M2 M3 M4 Supply (in units)

Market
Warehouse
W1 45 145 65 55 40
W2 75 65 85 05 50
W3 10 88 74 76 30
Demand(in 20 70 40 10
units)

10. A company has factories at F1, F2 and F3 that supply products to warehouse at W1,
W2 and W3. The weekly capacities of the factories are 190,185 and 125 units,
respectively. The weekly warehouse requirements are 200,130 and 170 units,
respectively. The unit shipping costs(in rupees) are as follows :

Warehouse
W1 W2 W3 Supply
F1 20 24 16 190
F2 18 12 22 185
Factory F3 30 28 20 125
Demand 200 130 170 500
 Determine the Optimal distribution for this company in order to minimize its total
shipping cost.

11. A Company has received a contract to supply gravel to three new construction
projects located in towns A,B and C. The construction engineers have estimated that
the required amounts of gravel which will be needed at these construction projects
are:

Project Location Weekly Requirement (Truckloads)

A 72
B 102
C 41

The company has 3 gravel pits located in towns X, Y and Z. The gravel required by
the construction projects can be supplied by three pits. The amount of gravel that
can be supplied by each pit is as follows

Plant :X Y Z

Amount available :76 82 77

(Truckloads)

The Company has computed the delivery cost from each pit to each project site.
These costs(in Rs) are shown in the following table :

Project Location
A B C
Pit X 4 8 8
Y 16 24 16
Z 8 16 24

Schedule the shipment from each pit to each project in such a manner that it
minimizes the total transportation cost within the constraints imposed by pit
capacities and project requirements. Also find the minimum cost.

12. ABC limited has three production shops that supply a product to five ware houses. The
cost of production varies from shop to shop and cost of transportation from one shop to a
 warehouse also varies. Each shop has a specific production capacity and each warehouse
has certain amount of requirement . The costs of transportation are given below

Shop Warehouse SUPPLY

I II III IV V

A 6 4 4 7 5 100

B 5 6 7 4 8 125

C 3 4 6 3 4 175

DEMAND 60 80 85 105 70 400

Find the optimum quantity to be supplied from each shop to different warehouses at the
minimum total cost

---------------------------------------------------------------------------------------